#include <diGraph.h>
Collaboration diagram for dgConnection:

Data Fields | |
| dgConnection * | next |
| dgNode * | node |
| dlNode * | edgeOnList |
Definition at line 43 of file diGraph.h.
struct dgConnection* dgConnection::next [read] |
Definition at line 46 of file diGraph.h.
Referenced by bfGraphFromRangeGraph(), dgDumpGraph(), dgFindNodeInConList(), dgFindPath(), dgFindSubEdges(), dgParentsAllVisited(), dgRemoveFromConList(), rFindConnected(), rHasCycles(), rPathExists(), and rTopoSort().
struct dgNode* dgConnection::node [read] |
Definition at line 47 of file diGraph.h.
Referenced by bfGraphFromRangeGraph(), dgConnectWithVal(), dgDumpGraph(), dgFindNodeInConList(), dgFindPath(), dgFindSubEdges(), dgNextList(), dgParentsAllVisited(), dgPrevList(), dgRemoveFromConList(), dgSwapEdges(), rFindConnected(), rHasCycles(), rPathExists(), and rTopoSort().
struct dlNode* dgConnection::edgeOnList [read] |
Definition at line 48 of file diGraph.h.
Referenced by bfGraphFromRangeGraph(), dgConnectWithVal(), dgDirectlyFollows(), dgFindSubEdges(), and dgRemoveFromConList().
1.5.2