|
|||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--graph.Couple
A couple is a pair (v,F) of a vertex and a Face at that vertex. Some algorithms in this package require an Enumeration of all of the couples in a graph.
Inner Class Summary | |
static class |
Couple.Test
Test Code for Couple |
Constructor Summary | |
Couple(Vertex V,
Face F)
|
Method Summary | |
static Couple[] |
getCouples(Couple firstCouple,
Graph G)
This returns an enumeration of all Couples in Graph G in a canonical order starting with firstCouple. |
Face |
getF()
|
Vertex |
getV()
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public Couple(Vertex V, Face F)
Method Detail |
public Vertex getV()
public Face getF()
public static Couple[] getCouples(Couple firstCouple, Graph G)
This enumeration is useful in finding explicit bijections of isomorphic graphs.
|
|||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |