rlin1
asked on
graph connectivity
I am looking for source code to determine the connectivity of a graph,
which has several mobile stations in it. Assume connect[no_ms][no_ms]
indicates the connectivity of a pair of two ms. 1 means connected,
0 means not.
which has several mobile stations in it. Assume connect[no_ms][no_ms]
indicates the connectivity of a pair of two ms. 1 means connected,
0 means not.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
If it's just 'are two nodes' connected there are all kinds of algorithms. Which algorithm you choose depends on things like 'does the graph have cycles in it'.