|
| | MGraph (int pid, int ncl, NCInput *mgi, Options *opt) |
| |
| | MGraph (int pid, int ncl, int *cldeg, int *clnum, int *clexl, int *cmind, int *cmaxd, Options *opt) |
| |
| void | init (void) |
| |
| BigInt | generate (void) |
| |
| Bool | isExternal (int nd) |
| |
| void | printAdjMat (MNodeClass *cl) |
| |
| void | print (void) |
| |
| void | printPy (FILE *fp, long mId) |
| |
| Bool | isConnected (void) |
| |
| Bool | visit (int nd) |
| |
| Bool | isIsomorphic (MNodeClass *cl) |
| |
| void | permMat (int size, int *perm, int **mat0, int **mat1) |
| |
| int | compMat (int size, int **mat0, int **mat1) |
| |
| MNodeClass * | refineClass (MNodeClass *cl) |
| |
| void | bisearchME (int nd, int pd, int ned, int col, MCOpi *mopi, MCBlock *mblk, ULong *momset, int *next, int *nart) |
| |
| void | biconnME (void) |
| |
| Bool | isOptM (void) |
| |
| void | connectClass (MNodeClass *cl) |
| |
| void | connectNode (int sc, int ss, MNodeClass *cl) |
| |
| void | connectLeg (int sc, int sn, int tc, int ts, MNodeClass *cl) |
| |
| void | newGraph (MNodeClass *cl) |
| |
Definition at line 793 of file grcc.h.
◆ MGraph() [1/2]
◆ MGraph() [2/2]
| MGraph |
( |
int |
pid, |
|
|
int |
ncl, |
|
|
int * |
cldeg, |
|
|
int * |
clnum, |
|
|
int * |
clexl, |
|
|
int * |
cmind, |
|
|
int * |
cmaxd, |
|
|
Options * |
opt |
|
) |
| |
◆ ~MGraph()
◆ init()
◆ generate()
◆ isExternal()
| Bool isExternal |
( |
int |
nd | ) |
|
|
inline |
◆ printAdjMat()
◆ print()
◆ printPy()
| void printPy |
( |
FILE * |
fp, |
|
|
long |
mId |
|
) |
| |
◆ isConnected()
| Bool isConnected |
( |
void |
| ) |
|
◆ visit()
◆ isIsomorphic()
◆ permMat()
| void permMat |
( |
int |
size, |
|
|
int * |
perm, |
|
|
int ** |
mat0, |
|
|
int ** |
mat1 |
|
) |
| |
◆ compMat()
| int compMat |
( |
int |
size, |
|
|
int ** |
mat0, |
|
|
int ** |
mat1 |
|
) |
| |
◆ refineClass()
◆ bisearchME()
| void bisearchME |
( |
int |
nd, |
|
|
int |
pd, |
|
|
int |
ned, |
|
|
int |
col, |
|
|
MCOpi * |
mopi, |
|
|
MCBlock * |
mblk, |
|
|
ULong * |
momset, |
|
|
int * |
next, |
|
|
int * |
nart |
|
) |
| |
◆ biconnME()
◆ isOptM()
◆ connectClass()
◆ connectNode()
| void connectNode |
( |
int |
sc, |
|
|
int |
ss, |
|
|
MNodeClass * |
cl |
|
) |
| |
◆ connectLeg()
| void connectLeg |
( |
int |
sc, |
|
|
int |
sn, |
|
|
int |
tc, |
|
|
int |
ts, |
|
|
MNodeClass * |
cl |
|
) |
| |
◆ newGraph()
◆ opt
◆ group
◆ orbits
◆ nodes
◆ mId
◆ clist
◆ pId
◆ nNodes
◆ nEdges
◆ nLoops
◆ nExtern
◆ nClasses
◆ mindeg
◆ maxdeg
◆ adjMat
◆ curcl
◆ egraph
◆ nsym
◆ esym
◆ cDiag
◆ c1PI
◆ cNoTadpole
◆ cNoTadBlock
◆ c1PINoTadBlock
◆ wscon
◆ wsopi
◆ ngen
◆ ngconn
◆ nCallRefine
◆ discardRefine
◆ discardDisc
◆ discardIso
◆ opi
◆ opiloop
◆ extself
◆ selfloop
◆ multiedge
◆ tadpole
◆ tadblock
◆ block
◆ bipart
◆ DUMMYPADDING1
◆ mconn
◆ modmat
◆ bidef
◆ bilow
◆ bicol
◆ bicount
◆ DUMMYPADDING2
The documentation for this class was generated from the following files: