aud.example.graph.Traversal Class Reference

interface for traversals of MyGraph More...

Inheritance diagram for aud.example.graph.Traversal:

Collaboration diagram for aud.example.graph.Traversal:

Public Member Functions
	Traversal (MyGraph g)
	initiate traversal of g More...
abstract String	name ()
	get traversal name More...
abstract void	start (MyNode s0)
	start traversal at node s0 More...
void	showMark (MyNode node)
	callback to give visual feedback on marking a node More...

Public Attributes
SingleStepper	singlestepper = null
	may halt if single stepper was set More...
int	nsteps = 1
	halt every nsteps steps in time_ More...
int	verbose = 0
	set verbosity (extra output if >0) More...

Protected Member Functions
void	initialize ()
	initialize graph for traversal (reset all attributes), provided for convenience to be called by start More...

Protected Attributes
MyGraph	g_ = null
int	time_ = 0

Detailed Description

interface for traversals of MyGraph

Definition at line 6 of file Traversal.java.

Constructor & Destructor Documentation

Traversal()

aud.example.graph.Traversal.Traversal

(

MyGraph

g

)

initiate traversal of g

Definition at line 18 of file Traversal.java.

                              {
    g_=g;
  }

References aud.example.graph.Traversal.g_.

Member Function Documentation

initialize()

void aud.example.graph.Traversal.initialize ( )

protected

initialize graph for traversal (reset all attributes), provided for convenience to be called by start

Definition at line 34 of file Traversal.java.

                              {
    for (MyNode node : g_) {
      node.ord=-1;
      node.p=null;
      node.d=Double.POSITIVE_INFINITY;
      node.f=Double.POSITIVE_INFINITY;
    }
  }

References aud.example.graph.Traversal.g_.

Referenced by aud.example.graph.BreadthFirstSearch.start(), aud.example.graph.DepthFirstSearch.start(), aud.example.graph.IterativeDFS1.start(), aud.example.graph.IterativeDFS2.start(), and aud.example.graph.PriorityFirstSearch.start().

Here is the caller graph for this function:

name()

abstract String aud.example.graph.Traversal.name ( )

abstract

get traversal name

Reimplemented in aud.example.graph.AStarShortestPath, aud.example.graph.BreadthFirstSearch, aud.example.graph.DepthFirstSearch, aud.example.graph.DijkstraShortestPaths, aud.example.graph.IterativeDFS1, aud.example.graph.IterativeDFS2, and aud.example.graph.PrimMinimumSpanningTree.

Referenced by aud.example.graph.TraversalExample.main().

Here is the caller graph for this function:

showMark()

void aud.example.graph.Traversal.showMark

(

MyNode

node

)

callback to give visual feedback on marking a node

Definition at line 44 of file Traversal.java.

                                    {
    node.color="lightblue";
  }

References aud.example.graph.MyNode.color.

Referenced by aud.example.graph.BreadthFirstSearch.start(), aud.example.graph.IterativeDFS1.start(), aud.example.graph.IterativeDFS2.start(), and aud.example.graph.PriorityFirstSearch.start().

Here is the caller graph for this function:

start()

abstract void aud.example.graph.Traversal.start ( MyNode  s0 )

abstract

start traversal at node s0

Reimplemented in aud.example.graph.AStarShortestPath, aud.example.graph.BreadthFirstSearch, aud.example.graph.DepthFirstSearch, aud.example.graph.IterativeDFS1, aud.example.graph.IterativeDFS2, and aud.example.graph.PriorityFirstSearch.

Referenced by aud.example.graph.TraversalExample.main().

Here is the caller graph for this function:

Member Data Documentation

g_

MyGraph aud.example.graph.Traversal.g_ = null

protected

Definition at line 7 of file Traversal.java.

Referenced by aud.example.graph.Traversal.initialize(), aud.example.graph.IterativeDFS1.start(), aud.example.graph.PriorityFirstSearch.start(), and aud.example.graph.Traversal.Traversal().

nsteps

int aud.example.graph.Traversal.nsteps = 1

halt every nsteps steps in time_

Definition at line 13 of file Traversal.java.

Referenced by aud.example.graph.TraversalExample.main().

singlestepper

SingleStepper aud.example.graph.Traversal.singlestepper = null

may halt if single stepper was set

Definition at line 11 of file Traversal.java.

Referenced by aud.example.graph.TraversalExample.main().

time_

int aud.example.graph.Traversal.time_ = 0

protected

Definition at line 8 of file Traversal.java.

verbose

int aud.example.graph.Traversal.verbose = 0

set verbosity (extra output if >0)

Definition at line 15 of file Traversal.java.

Referenced by aud.example.graph.TraversalExample.main(), aud.example.graph.BreadthFirstSearch.start(), aud.example.graph.IterativeDFS1.start(), aud.example.graph.IterativeDFS2.start(), and aud.example.graph.PriorityFirstSearch.start().

---

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

• Traversal.java