representing a LAN as a graph

A computer network is to be represented as an adjacency list such that each node of the adjacency list will represent one node of the network and to which other nodes it has a direct link with(considering that each node has bidirectional link with its immediate neighbours). The betweenness centrality of each of the nodes needs to be found and the nodes are to be arranged in descending order in an array. Program control needs to transfer to any of the nodes (based on some if condition) and run some commands/program in any node.(This part needs threading?) How to do this entire thing using a C-program -??

Sounds like homework.

What have youo considered? How have you tried?

Have you done any research on what you might need to anser this question yourself?

What do you already know?

Well to begin with.. no i haven't tried much. But just came across this link.. mpi and parallel programming. and i was wondering if apart from mpi this could be done using thread programming?? It has to be MORE than the usual taking input of a graph as an adjacency list and then traversing
the graph.. to build the graph the node in which the program would run should have an overall picture of the entire network to which it is connected and build the graph from there. But i dont know how to do that programmatically? Much later comes the program control getting transferred to the different nodes in the graph where programs could be run using threading. Program control getting transferred needs info of which node to get transferred to from the graph. I'm also planning to do this using virtual box and openvswitch (to create different nodes in a network). Please help....

Originally Posted by wpeckham Sounds like homework. What have youo considered? How have you tried? Have you done any research on what you might need to anser this question yourself? What do you already know?