diGraph Struct Reference

#include <diGraph.h>

Collaboration diagram for diGraph:

[legend]

Data Fields
dgNode *	nodeList
hash *	nodeHash
dlList *	edgeList

---

Detailed Description

Definition at line 9 of file diGraph.h.

---

Field Documentation

struct dgNode* diGraph::nodeList [read]

Definition at line 12 of file diGraph.h.

Referenced by bfGraphFromRangeGraph(), connectedComponents(), dgAddNode(), dgClearConnFlags(), dgClearVisitFlags(), dgConstrainedPriorityOrder(), dgDumpGraph(), dgFindNextConnected(), dgFindNextConnectedWithVals(), dgFindPath(), dgFree(), dgHasCycles(), and dgTopoSort().

struct hash* diGraph::nodeHash [read]

Definition at line 13 of file diGraph.h.

Referenced by dgAddNode(), dgFindNode(), dgFree(), and dgNew().

struct dlList* diGraph::edgeList [read]

Definition at line 14 of file diGraph.h.

Referenced by bfGraphFromRangeGraph(), dgConnectWithVal(), dgFree(), and dgNew().

---

The documentation for this struct was generated from the following file:

• inc/diGraph.h

---