Link to home
Start Free TrialLog in
Avatar of rlin1
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.
Avatar of keitha1
keitha1

If you are looking for optimal (most efficient) connectivity check out the Minimum Spanning Tree algorithm.

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'.
ASKER CERTIFIED SOLUTION
Avatar of bcladd
bcladd

Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial