|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.experimental.isomorphism.GraphOrdering<V,E>
public class GraphOrdering<V,E>
Holds graph information as int labels only. vertexes: 1,2,3,4 edges:1->2 , 3->4 ,1->1. Implementation as imutable graph by int[] for vetexes and LabelsEdge[] for edges. The current algorithms do not support graph with multiple edges (Multigraph / Pseudograph). For the maintaner: The reason for it is the use of edges sets of LabelsEdge in which the equals checks for source and target vertexes. Thus there cannot be two LabelsEdge with the same source and target in the same Set.
Constructor Summary | |
---|---|
GraphOrdering(Graph<V,E> regularGraph)
Creates a new labels graph according to the regular graph. |
|
GraphOrdering(Graph<V,E> regularGraph,
Set<V> vertexSet,
Set<E> edgeSet)
Creates a new labels graph according to the regular graph. |
Method Summary | |
---|---|
boolean |
equalsByEdgeOrder(GraphOrdering otherGraph)
Tests equality by order of edges |
Set<org.jgrapht.experimental.isomorphism.GraphOrdering.LabelsEdge> |
getLabelsEdgesSet()
|
String |
toString()
This is the format example: |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public GraphOrdering(Graph<V,E> regularGraph)
regularGraph
- public GraphOrdering(Graph<V,E> regularGraph, Set<V> vertexSet, Set<E> edgeSet)
regularGraph
- vertexSet
- edgeSet
- Method Detail |
---|
public boolean equalsByEdgeOrder(GraphOrdering otherGraph)
public Set<org.jgrapht.experimental.isomorphism.GraphOrdering.LabelsEdge> getLabelsEdgesSet()
public String toString()
mapVertexToOrder= labelsOrder=
toString
in class Object
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |