EGdGraphNode_t Struct Reference

#include <eg_dgraph.h>

Collaboration diagram for EGdGraphNode_t:

[legend]

---

Detailed Description

Implementation of basic digraph support, the idea is that this structure should be flexible enough to support fast graph algorithm.

2003-07-02 - First implementation (Marcos).

Definition at line 41 of file eg_dgraph.h.

Data Fields
EGlistNode_t *	cn
void *	data
unsigned int	id
EGlist_t *	in_edges
EGlist_t *	out_edges

---

Field Documentation

EGlistNode_t* EGdGraphNode_t::cn

Definition at line 45 of file eg_dgraph.h.

void* EGdGraphNode_t::data

Definition at line 46 of file eg_dgraph.h.

unsigned int EGdGraphNode_t::id

Definition at line 47 of file eg_dgraph.h.

EGlist_t* EGdGraphNode_t::in_edges

Definition at line 43 of file eg_dgraph.h.

EGlist_t* EGdGraphNode_t::out_edges

Definition at line 44 of file eg_dgraph.h.

---

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

• eg_dgraph.h

---