#include <denseBigraph.h>
Inheritance diagram for denseBiGraph:
Public Member Functions | |
denseBiGraph (TNode _n1, TNode _n2, TOption options=0, goblinController &_CT=goblinDefaultContext) throw () | |
denseBiGraph (const char *fileName, goblinController &_CT=goblinDefaultContext) throw (ERFile,ERParse) | |
denseBiGraph (abstractBiGraph &G) throw () | |
~denseBiGraph () throw () | |
void | ReadNNodes (goblinImport &F) throw (ERParse) |
unsigned long | Size () const throw () |
unsigned long | Allocated () const throw () |
TArc | Adjacency (TNode u, TNode v, TMethAdjacency method=ADJ_MATRIX) const throw (ERRange) |
TNode | StartNode (TArc a) const throw (ERRange) |
TNode | EndNode (TArc a) const throw (ERRange) |
TArc | First (TNode v) const throw (ERRange) |
TArc | Right (TArc a, TNode v=NoNode) const throw (ERRange) |
Protected Attributes | |
denseRepresentation | X |
|
Default constructor for dense bigraphs.
|
|
File constructor for dense bigraphs.
|
|
Copy constructor for dense bigraphs.
|
|
|
|
|
|
Reimplemented from abstractBiGraph. |
|
Query the end node of a given arc.
Reimplemented from abstractMixedGraph. |
|
Retrieve an arc with a given start node. The First(v) incidence is somewhat arbitrary, since icidence lists are cyclic. But when an arc is inserted, it is inserted into the incidence lists right after the First() incidence. If the graph is planely represented, and v is an exterior node, the first two incidences are usually exterior arcs, and inserting an arc with two exterior end nodes preserves the planar representation.
Implements abstractMixedGraph. |
|
Read the number of nodes from file.
Reimplemented from abstractBiGraph. |
|
Query the successor of a given arc in the incidence list of its start node.
Implements abstractMixedGraph. |
|
Implements goblinRootObject. |
|
Query the start node of a given arc.
Implements abstractMixedGraph. |
|
|