graph.cpp

clustering for ns-2 simulation

#include <fstream>
#include <sstream>

#include "graph.h"
#include "verifier.h"

void cancelNode(int node, Graph & graph)
{
	for (NodeList::iterator n = graph[node].begin(); n != graph[node].end(); n++)
		graph[*n].erase(node);
	graph.erase(node);
}

void changeToGraph(string & fileName) {
    istringstream in(fileName);
    string tmp;
    getline(in, tmp, 'S');
    in >> tmp;
    tmp = "graphS" + tmp;
    fileName = tmp;
}

void connect(int nodeA, int nodeB, Graph & graph)
{
    graph[nodeA].insert(nodeB);
    graph[nodeB].insert(nodeA);
}

//
// Calcola il numero di links e il degree di un grafo.
//
void countLinks(Graph & graph, int & links) 
{
    links = 0;
    for (Graph::iterator i = graph.begin(); i != graph.end(); i++)
        links += (i->second).size();
    links = links / 2;
}