|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.stanford.nlp.graph.ConnectedComponents<V,E>
public class ConnectedComponents<V,E>
Finds connected components in the graph, currently uses inefficient list for variable 'verticesLeft'. It might give a problem for big graphs
Constructor Summary | |
---|---|
ConnectedComponents()
|
Method Summary | ||
---|---|---|
static
|
getConnectedComponents(DirectedMultiGraph<V,E> graph)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public ConnectedComponents()
Method Detail |
---|
public static <V,E> java.util.List<java.util.Set<V>> getConnectedComponents(DirectedMultiGraph<V,E> graph)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |