|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectorg.jgrapht.graph.DefaultGraphMapping<V,E>
public class DefaultGraphMapping<V,E>
Implementation of the GraphMapping interface. The performance of
getVertex/EdgeCorrespondence is based on the performance of the
concrete Map class which is passed in the constructor. For example, using
hashmaps will provide O(1) performence.
| Constructor Summary | |
|---|---|
DefaultGraphMapping(java.util.Map<V,V> g1ToG2,
java.util.Map<V,V> g2ToG1,
Graph<V,E> g1,
Graph<V,E> g2)
The maps themselves are used. |
|
| Method Summary | |
|---|---|
E |
getEdgeCorrespondence(E currEdge,
boolean forward)
Gets the mapped value where the key is edge |
V |
getVertexCorrespondence(V keyVertex,
boolean forward)
Gets the mapped value where the key is vertex |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public DefaultGraphMapping(java.util.Map<V,V> g1ToG2,
java.util.Map<V,V> g2ToG1,
Graph<V,E> g1,
Graph<V,E> g2)
g1ToG2 - g2ToG1 - g1 - g2 - | Method Detail |
|---|
public E getEdgeCorrespondence(E currEdge,
boolean forward)
GraphMappingedge
getEdgeCorrespondence in interface GraphMapping<V,E>currEdge - edge in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
mapping from graph2 to graph1
public V getVertexCorrespondence(V keyVertex,
boolean forward)
GraphMappingvertex
getVertexCorrespondence in interface GraphMapping<V,E>keyVertex - vertex in one of the graphsforward - if true, uses mapping from graph1 to graph2; if false, use
mapping from graph2 to graph1
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||