SourceForge Logo
P.I.G.A.L.E.
1.3.9
Public Implementation of a Graph Algorithm
Library and Editor
H. de Fraysseix      P. Ossona de Mendez

SchaefferGen.cpp File Reference

Include dependency graph for SchaefferGen.cpp:

Defines

Typedefs

Functions

Variables

Define Documentation

#define BLACK   2

#define BLACK2   3

#define CLSD   10

#define COFREE   12

#define DLTD   20

#define DONE   42

#define FORCED   40

#define FREE   8

#define FREE2   9

#define INNER   16

#define MSK   'a'

#define Next   oppo->next

#define Oppo   oppo

#define OUTER   18

#define PMFALSE   0

#define pmRandom   randomGet

#define PMTRUE   -1

#define Prev   prev->oppo

#define printvf   if (Meth->verbose) printf

#define printwf   if (Meth->verbose == PMTRUE+PMTRUE) printf

#define ROOT   6

#define VIRT   14

#define WHITE   4

Typedef Documentation

typedef struct e pm_edge

typedef struct v pm_vertex

typedef struct pmmap pmMap

typedef struct pmmemory pmMemory

typedef struct pmmethod pmMethod

typedef struct pmoutput pmOutput

typedef struct pmsize pmSize

typedef struct pmstats pmStats

typedef struct st pmStck

Function Documentation

GraphContainer* GenerateSchaeffer ( int  n_ask,
int  type,
int  e_connectivity,
bool  randomEraseMultipleEdges,
bool  randomUseGeneratedCir 
)

long pmAddFaces ( pm_edge *  Root  ) 

pm_edge* pmBalance ( pm_edge *  Root  ) 

long pmBicolorFaces ( pm_edge *  Root  ) 

void pmC3kernel ( pm_edge *  Root  ) 

long pmChainFaces ( pm_edge *  Root  ) 

long pmChainVtx ( pm_edge *  Root  ) 

int pmCheck1 ( pm_edge *  Edge  ) 

int pmCheck2 ( pm_edge *  Edge  ) 

int pmCheck3 ( pm_edge *  Edge  ) 

int pmCheck4 ( pm_edge *  Edge  ) 

pm_edge* pmChottin2tree ( long  st,
char  LkWrd[] 
)

void pmClearLblFace ( pm_vertex *  Face  ) 

void pmClearLblVtx ( pm_vertex *  Vtx  ) 

pm_edge* pmClosure ( pm_edge *  Free,
pmStck *  Stk 
)

void pmCopyPostSeed ( void   ) 

void pmCreateBloc ( long  n  ) 

void pmCreateComp ( long  n  ) 

void pmCreateEdge ( long  n  ) 

void pmCreatePost ( long  n  ) 

void pmCreateSeed ( long  n  ) 

void pmCreateStck ( long  n,
pmStck *  Stack 
)

void pmCreateVtx ( long  n  ) 

void pmCreateWrd ( long  n,
char **  Wrd 
)

long pmCurMark (  ) 

void pmEdgeMap ( pmMap *  Map  ) 

pm_edge* pmEmptyEdge (  ) 

int pmExtendMemory ( pmSize *  S,
pmMethod *  Meth,
pmMemory *  M,
char  OtherReason 
)

int pmExtract ( pmSize *  S,
pmMethod *  Meth,
pmMemory *  M,
pmMap *  Map 
)

void pmFirstComp ( void   ) 

void pmFirstSeed ( void   ) 

void pmFreeBloc (  ) 

void pmFreeComp (  ) 

void pmFreeEdge (  ) 

int pmFreeMap ( pmMap *  Map  ) 

void pmFreePost (  ) 

void pmFreeSeed (  ) 

void pmFreeStck ( pmStck  Stack  ) 

void pmFreeVtx (  ) 

void pmFreeWrd ( char *  Wrd  ) 

void pmFull2to3c ( pm_edge *  Root  ) 

void pmFull2to3tri ( pm_edge *  Root  ) 

void pmFull2to4tri ( pm_edge *  Root  ) 

void pmFull4rtosimple ( pm_edge *  Root  ) 

pm_edge* pmGet3c ( pm_edge *  Root  ) 

pm_edge* pmGet3tri ( pm_edge *  Root  ) 

pm_edge* pmGet4tri ( pm_edge *  Root  ) 

pm_edge* pmGetsimple4r ( pm_edge *  Root  ) 

int pmInitRND ( pmMethod *   ) 

int pmInSum ( pm_edge *  Root  ) 

int pmIsBloc (  ) 

int pmIsComp (  ) 

int pmIsPost (  ) 

int pmIsSeed (  ) 

long pmLabelCanon ( pm_edge *  Root  ) 

void pmLabelFaces ( pm_vertex *  Face  ) 

long pmLuka1 ( long  n,
long  k,
char *  LkWrd 
)

long pmLuka2 ( long  l,
long  DgArr[],
char  LkWrd[] 
)

pm_edge* pmLuka2tree ( long  st,
char  LkWrd[] 
)

long pmLuka3 ( long  i,
long  j,
char  LkWrd[] 
)

void pmMakeaFace ( pm_edge *  C1,
pm_vertex *  Fce,
long  mark,
long *  nbf 
)

void pmMemoryFault ( void   ) 

int pmMemoryInit ( pmSize *  S,
pmMethod *  Meth,
pmMemory *  M 
)

void pmNewBloc ( pm_edge *  e  ) 

void pmNewComp ( pm_edge *  e  ) 

pm_edge* pmNewEdge ( pm_vertex *  from,
pm_edge *  prev,
pm_edge *  next,
pm_edge *  oppo,
short  type 
)

pm_vertex* pmNewFace ( pm_edge *  Edge  ) 

long pmNewLabel (  ) 

long pmNewMark (  ) 

void pmNewPost ( pm_edge *  e  ) 

void pmNewSeed ( pm_edge *  e  ) 

pm_vertex* pmNewVtx ( pm_edge *  Edge  ) 

pm_edge* pmNextBloc ( void   ) 

pm_edge* pmNextComp ( void   ) 

pm_edge* pmNextPost ( void   ) 

pm_edge* pmNextSeed ( void   ) 

int pmParseArgs ( int  argc,
char *  argv[],
pmSize *  Size,
pmMethod *  Meth,
pmOutput *  Outp 
)

int pmPlanMap ( pmSize *  S,
pmMethod *  Meth,
pmMemory *  M,
pmMap *  Map 
)

void pmResetPost (  ) 

int pmSetParameters ( pmSize *  Size,
pmMethod *  Meth 
)

void pmSimplekernel ( pm_edge *  Root  ) 

void pmSpring1 ( pm_edge *  Root  ) 

void pmSpring2 ( pm_edge *  Root  ) 

void pmSpring3 ( pm_edge *  Root  ) 

void pmSpring4 ( pm_edge *  Root  ) 

void pmSpring5 ( pm_edge *  Root  ) 

void pmStckIn ( pm_edge *  e,
pmStck *  Stack 
)

pm_edge* pmStckOut ( pmStck *  Stack  ) 

pm_edge* pmSuppress ( pm_edge *  Root  ) 

int pmTreeConjugation ( pmSize *  S,
pmMemory *  M,
pmMap *  Map 
)

void pmTri3kernel ( pm_edge *  Root  ) 

void pmTri4kernel ( pm_edge *  Root  ) 

pm_edge* pmVide2cocycle ( pm_edge *  Root,
pm_edge *  Cot1 
)

pm_edge* pmVide2cocycle4r ( pm_edge *  Root,
pm_edge *  Cot1 
)

pm_edge* pmVide3cocycle ( pm_edge *  Root,
pm_edge *  Cot1,
pm_edge *  Cot2 
)

pm_edge* pmVide4cocycle ( pm_edge *  Root,
pm_edge *  Cot1,
pm_edge *  Cot2,
pm_edge *  Cot3 
)

Variable Documentation

long pmAbsLabel = 1

long pmAbsMark = 1

pm_edge** pmBloc

long pmBlocBeg

long pmBlocEnd

pm_edge** pmComp

long pmCompBeg

long pmCompEnd

pm_edge* pmEdgeSet

long pmNxtEdgeNbr = -1

long pmNxtVtxNbr = -1

pm_edge** pmPost

long pmPostBeg

long pmPostEnd

pm_edge** pmSeed

long pmSeedBeg

long pmSeedEnd

pm_vertex* pmVtxSet

Generated on Thu Jan 31 16:51:23 2008 for Pigale by  doxygen 1.5.4