graph.h

clustering for ns-2 simulation

#ifndef _GRAPH_H_
#define _GRAPH_H_

#include <map>
#include <set>
#include <string>

using namespace std;

// Node list
typedef set<int> NodeList;

// Graph definition.
typedef map<int, NodeList> Graph;

// Connect two nodes.
void connect(int nodeA, int nodeB, Graph & graph);

// Erase a node from a graph and all links related to it.
void cancelNode(int node, Graph & graph);

// Calcola il numero di links e il degree di un grafo.
void countLinks(Graph & graph, int & links);

void changeToGraph(string & fileName);

#endif