|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg._3pq.jgrapht.graph.AbstractGraph
org._3pq.jgrapht.graph.AbstractBaseGraph
org._3pq.jgrapht.graph.SimpleGraph
A simple graph. A simple graph is an undirected graph for which at most one edge connects any two vertices, and loops are not permitted. If you're unsure about simple graphs, see: http://mathworld.wolfram.com/SimpleGraph.html.
Constructor Summary | |
SimpleGraph()
Creates a new simple graph. |
|
SimpleGraph(EdgeFactory ef)
Creates a new simple graph with the specified edge factory. |
Methods inherited from class org._3pq.jgrapht.graph.AbstractBaseGraph |
addEdge, addEdge, addVertex, clone, containsEdge, containsVertex, degreeOf, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, incomingEdgesOf, inDegreeOf, isAllowingLoops, isAllowingMultipleEdges, outDegreeOf, outgoingEdgesOf, removeEdge, removeEdge, removeVertex, setEdgeListFactory, vertexSet |
Methods inherited from class org._3pq.jgrapht.graph.AbstractGraph |
addAllEdges, addAllVertices, assertVertexExist, containsEdge, removeAllEdges, removeAllEdges, removeAllEdges, removeAllVertices, toString, toStringFromSets |
Methods inherited from class java.lang.Object |
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Methods inherited from interface org._3pq.jgrapht.UndirectedGraph |
degreeOf |
Methods inherited from interface org._3pq.jgrapht.Graph |
addAllEdges, addAllVertices, addEdge, addEdge, addVertex, containsEdge, containsEdge, containsVertex, edgeSet, edgesOf, getAllEdges, getEdge, getEdgeFactory, removeAllEdges, removeAllEdges, removeAllVertices, removeEdge, removeEdge, removeVertex, vertexSet |
Constructor Detail |
public SimpleGraph(EdgeFactory ef)
ef
- the edge factory of the new graph.public SimpleGraph()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |