dgNode Struct Reference

#include <diGraph.h>

Collaboration diagram for dgNode:

[legend]

Data Fields
dgNode *	next
char *	name
void *	val
dgConnection *	nextList
dgConnection *	prevList
int	topoOrder
int	component
int	priority
dgNode *	tempEntry
bool	visited
bool	conn
bool	flagA
bool	flagB

---

Detailed Description

Definition at line 17 of file diGraph.h.

---

Field Documentation

struct dgNode* dgNode::next [read]

Definition at line 20 of file diGraph.h.

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

char* dgNode::name

Definition at line 21 of file diGraph.h.

Referenced by dgAddNode(), dgConnectWithVal(), dgDumpGraph(), dgFindSubEdges(), dgNodeName(), and dgNodeNumber().

void* dgNode::val

Definition at line 22 of file diGraph.h.

Referenced by connectedComponents(), dgAddNode(), dgFindNextConnectedWithVals(), dgNodeVal(), and rFindConnected().

struct dgConnection* dgNode::nextList [read]

Definition at line 23 of file diGraph.h.

Referenced by bfGraphFromRangeGraph(), dgConnectWithVal(), dgDirectlyFollows(), dgDisconnect(), dgDumpGraph(), dgFindPath(), dgFindSubEdges(), dgNextList(), dgNodeFree(), dgSwapEdges(), rFindConnected(), rHasCycles(), rPathExists(), and rTopoSort().

struct dgConnection* dgNode::prevList [read]

Definition at line 24 of file diGraph.h.

Referenced by dgConnectWithVal(), dgDisconnect(), dgNodeFree(), dgParentsAllVisited(), dgPrevList(), dgSwapEdges(), and rFindConnected().

int dgNode::topoOrder

Definition at line 25 of file diGraph.h.

Referenced by bfGraphFromRangeGraph(), rHasCycles(), and rTopoSort().

int dgNode::component

Definition at line 26 of file diGraph.h.

Referenced by connectedComponents().

int dgNode::priority

Definition at line 27 of file diGraph.h.

Referenced by cmpPriority().

struct dgNode* dgNode::tempEntry [read]

Definition at line 28 of file diGraph.h.

Referenced by dgFindPath().

bool dgNode::visited

Definition at line 29 of file diGraph.h.

Referenced by dgClearVisitFlags(), dgConstrainedPriorityOrder(), dgHasCycles(), dgParentsAllVisited(), dgTopoSort(), rHasCycles(), rPathExists(), and rTopoSort().

bool dgNode::conn

Definition at line 30 of file diGraph.h.

Referenced by connectedComponents(), dgClearConnFlags(), dgFindNextConnected(), dgFindNextConnectedWithVals(), and rFindConnected().

bool dgNode::flagA

Definition at line 31 of file diGraph.h.

bool dgNode::flagB

Definition at line 32 of file diGraph.h.

---

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

• inc/diGraph.h

---