graph
Class Couple

java.lang.Object
  |
  +--graph.Couple

public class Couple
extends java.lang.Object

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

Couple

public Couple(Vertex V,
              Face F)
Method Detail

getV

public Vertex getV()

getF

public Face getF()

getCouples

public static Couple[] getCouples(Couple firstCouple,
                                  Graph G)
This returns an enumeration of all Couples in Graph G in a canonical order starting with firstCouple. The order is canonical in the sense that it only depends on the oriented isomorphism class of G (and firstCouple). That is, if there is an oriented iso G <-> G' sending firstCouple <-> firstCouple', then that bijection will send getCouples <-> getCouples'.

This enumeration is useful in finding explicit bijections of isomorphic graphs.