|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface GraphMapping<V,E>
GraphMapping represents a bidirectional mapping between two graphs (called graph1 and graph2), which allows the caller to obtain the matching vertex or edge in either direction, from graph1 to graph2, or from graph2 to graph1. It does not have to always be a complete bidirectional mapping (it could return null for some lookups).
Method Summary | |
---|---|
E |
getEdgeCorrespondence(E edge,
boolean forward)
Gets the mapped value where the key is edge |
V |
getVertexCorrespondence(V vertex,
boolean forward)
Gets the mapped value where the key is vertex |
Method Detail |
---|
V getVertexCorrespondence(V vertex, boolean forward)
vertex
vertex
- vertex in one of the graphsforward
- if true, uses mapping from graph1 to graph2; if false, use
mapping from graph2 to graph1
E getEdgeCorrespondence(E edge, boolean forward)
edge
edge
- edge 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 |