|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjavatools.datatypes.DirectedGraph<E>
javatools.datatypes.UndirectedGraph<E>
public class UndirectedGraph<E extends java.lang.Comparable<E>>
This class is part of the Java Tools (see http://mpii.de/yago-naga/javatools). It is licensed under the Creative Commons Attribution License (see http://creativecommons.org/licenses/by/3.0) by the YAGO-NAGA team (see http://mpii.de/yago-naga). This class implements an undirected graph.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from class javatools.datatypes.DirectedGraph |
|---|
DirectedGraph.Node<E extends java.lang.Comparable<E>> |
| Constructor Summary | |
|---|---|
UndirectedGraph()
|
|
| Method Summary | |
|---|---|
DirectedGraph.Node<E> |
getOrMake(E label)
Returns a node or creates it |
| Methods inherited from class javatools.datatypes.DirectedGraph |
|---|
addLink, contains, create, get, labels, leaves, makeClosure, nodes, numNodes, roots, toString |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public UndirectedGraph()
| Method Detail |
|---|
public DirectedGraph.Node<E> getOrMake(E label)
getOrMake in class DirectedGraph<E extends java.lang.Comparable<E>>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||