Grafalgo
Library of useful data structures and algorithms
grafalgo::Digraph Member List
This is the complete list of members for grafalgo::Digraph, including all inherited members.
addEdges(int)grafalgo::Graph
adjList2string(vertex, string &) const grafalgo::Digraph [protected, virtual]
adjListsgrafalgo::Graph [protected]
Adt(index size=26) (defined in grafalgo::Adt)grafalgo::Adt [inline]
Adt(const Adt &) (defined in grafalgo::Adt)grafalgo::Adt
clear()grafalgo::Graph [virtual]
copyFrom(const Graph &)grafalgo::Graph
Digraph(int=1, int=1)grafalgo::Digraph
ecmp(edge, edge, vertex) const (defined in grafalgo::Graph)grafalgo::Graph [protected]
edge2string(edge, string &) const grafalgo::Graph [virtual]
edge2string(edge, vertex, string &) const grafalgo::Graph [virtual]
edgesgrafalgo::Graph [protected]
elist2string(list< int > &, string &) const grafalgo::Graph [virtual]
evecgrafalgo::Graph [protected]
expand(int, int)grafalgo::Digraph [virtual]
expand(int numv) (defined in grafalgo::Digraph)grafalgo::Digraph [inline, virtual]
fegrafalgo::Graph [protected]
figrafalgo::Digraph [private]
first() const grafalgo::Graph [inline]
firstAt(vertex) const grafalgo::Digraph [inline, virtual]
firstIn(vertex) const grafalgo::Digraph [inline]
firstOut(vertex) const grafalgo::Digraph [inline]
freeSpace()grafalgo::Digraph [protected]
getComponents(int *) const grafalgo::Graph
getEdge(vertex, vertex) const grafalgo::Graph
Graph(int=1, int=1)grafalgo::Graph
head(edge) const grafalgo::Digraph [inline]
item2string(index, string &) const (defined in grafalgo::Adt)grafalgo::Adt [virtual]
join(vertex, vertex)grafalgo::Graph [virtual]
joinWith(vertex, vertex, edge)grafalgo::Digraph [virtual]
left(edge) const grafalgo::Graph [inline]
m() const grafalgo::Graph [inline]
makeSpace(int, int)grafalgo::Digraph [protected]
mate(vertex, edge) const grafalgo::Graph [inline]
maxEdgegrafalgo::Graph [protected]
MAXINDEX (defined in grafalgo::Adt)grafalgo::Adt [static]
MAXPOSITION (defined in grafalgo::Adt)grafalgo::Adt [static]
mmgrafalgo::Graph [protected]
n() const (defined in grafalgo::Adt)grafalgo::Adt [inline]
next(edge) const grafalgo::Graph [inline]
nextAt(vertex, edge) const grafalgo::Digraph [inline, virtual]
nextIn(vertex, edge) const grafalgo::Digraph [inline]
nextOut(vertex, edge) const grafalgo::Digraph [inline]
nngrafalgo::Adt [protected]
operator<< (defined in grafalgo::Adt)grafalgo::Adt [friend]
operator=(const Digraph &) (defined in grafalgo::Digraph)grafalgo::Digraph [private]
operator=(const Adt &) (defined in grafalgo::Adt)grafalgo::Adt
operator=(Adt &&) (defined in grafalgo::Adt)grafalgo::Adt
operator>>(istream &, Graph &)grafalgo::Graph [friend]
rbigraph(int, int)grafalgo::Graph
rcgraph(int, int)grafalgo::Graph
rdag(int, int)grafalgo::Digraph
readAdjList(istream &)grafalgo::Digraph [protected, virtual]
readItem(istream &, index &)grafalgo::Adt [static]
remove(edge)grafalgo::Digraph
resize(int, int)grafalgo::Digraph [virtual]
resize(int numv) (defined in grafalgo::Digraph)grafalgo::Digraph [inline, virtual]
rgraph(int, int)grafalgo::Digraph
rgraph(int, int, int) (defined in grafalgo::Graph)grafalgo::Graph
right(edge) const grafalgo::Graph [inline]
rtree(int)grafalgo::Graph
scramble()grafalgo::Graph
shuffle(int *, int *) (defined in grafalgo::Graph)grafalgo::Graph [protected]
sortAdjLists()grafalgo::Graph
sortAlist(vertex)grafalgo::Graph [protected]
tail(edge) const grafalgo::Digraph [inline]
toDotString(string &) const grafalgo::Digraph [virtual]
toString(string &) const grafalgo::Graph [virtual]
validEdge(int) const grafalgo::Graph [inline]
validVertex(int) const grafalgo::Graph [inline]
~Adt() (defined in grafalgo::Adt)grafalgo::Adt [inline, virtual]
~Digraph() (defined in grafalgo::Digraph)grafalgo::Digraph
~Graph() (defined in grafalgo::Graph)grafalgo::Graph
 All Classes Files Functions Variables Typedefs Friends