PUBLIC

GraphConnIterC::GraphConnIterC(GraphNodeIterC &) GraphConnIterC::GraphConnIterC(GraphConnIterC &) GraphConnIterC::Node(void) GraphConnIterC::Data(void) GraphConnIterC::operator ==(const GraphNodeIterC &) const GraphConnIterC::AddOpen(const GraphNodeIterC &) GraphBaseConnIterC::First(const GraphNodeBaseC &) GraphBaseConnIterC::Next(void) GraphBaseConnIterC::Prune(void) GraphBaseConnIterC::IsElm(void) const GraphBaseConnIterC::IsVisited(const GraphNodeBaseC &) const GraphBaseConnIterC::Visited(const GraphNodeBaseC &) GraphBaseConnIterC::AddOpen(const GraphNodeBaseC &) GraphBaseConnIterC::Data(void) GraphBaseConnIterC::Data(void) const

public GraphBaseConnIterC

GraphConnIterC(GraphNodeIterC<NodeT,EdgeT> & Nd)

Constructor

GraphConnIterC(GraphConnIterC<NodeT,EdgeT> & Oth)

Copy constructor

GraphNodeIterC<NodeT,EdgeT> Node(void)

Get a node iterator.

NodeT & Data(void)

Get some data.

bool operator ==(const GraphNodeIterC<NodeT,EdgeT> & Nd) const

At a particular node ?

void AddOpen(const GraphNodeIterC<NodeT,EdgeT> & Nd)

Add node to open list.

void First(const GraphNodeBaseC & Nd)

Goto first node.

void Next(void)

Goto next node, add current nodes outgoing links to those in the open list.

void Prune(void)

Move to next node, don't include this nodes children for iteration.

bool IsElm(void) const

At valid element.

bool IsVisited(const GraphNodeBaseC & Nd) const

Have visited node ?

void Visited(const GraphNodeBaseC & Nd)

Flag node as being visited.

bool AddOpen(const GraphNodeBaseC & Nd)

Add node to open list.

GraphNodeBaseC & Data(void)

Get some data.

const GraphNodeBaseC & Data(void) const

Get some data.