|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Object | +--jdsl.core.algo.graphtraversals.ConnectivityTest
This algorithm tests if a graph is connected by running FindAllVerticesDFS and then counting if the number of vertices visited by DFS is equal to the total number of vertices in the graph.
| Constructor Summary | |
ConnectivityTest()
|
|
| Method Summary | |
static boolean |
isConnected(InspectableGraph g)
|
| Methods inherited from class java.lang.Object |
equals,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
| Constructor Detail |
public ConnectivityTest()
| Method Detail |
public static boolean isConnected(InspectableGraph g)
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||