aud.example.graph.BreadthFirstSearch Class Reference

implements BFS More...

Inheritance diagram for aud.example.graph.BreadthFirstSearch:

Collaboration diagram for aud.example.graph.BreadthFirstSearch:

Public Member Functions
	BreadthFirstSearch (MyGraph g)
String	name ()
	get traversal name More...
void	start (MyNode s0)
	start traversal at node s0 More...
Public Member Functions inherited from aud.example.graph.Traversal
	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...

Additional Inherited Members
Public Attributes inherited from aud.example.graph.Traversal
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 inherited from aud.example.graph.Traversal
void	initialize ()
	initialize graph for traversal (reset all attributes), provided for convenience to be called by start More...
Protected Attributes inherited from aud.example.graph.Traversal
MyGraph	g_ = null
int	time_ = 0

Detailed Description

implements BFS

Definition at line 6 of file BreadthFirstSearch.java.

Constructor & Destructor Documentation

BreadthFirstSearch()

aud.example.graph.BreadthFirstSearch.BreadthFirstSearch

(

MyGraph

g

)

Definition at line 8 of file BreadthFirstSearch.java.

                                       {
    super(g);
  }

Member Function Documentation

name()

String aud.example.graph.BreadthFirstSearch.name

(

)

get traversal name

Reimplemented from aud.example.graph.Traversal.

Definition at line 12 of file BreadthFirstSearch.java.

{ return "BFS"; };

start()

void aud.example.graph.BreadthFirstSearch.start

(

MyNode

s0

)

start traversal at node s0

Reimplemented from aud.example.graph.Traversal.

Definition at line 14 of file BreadthFirstSearch.java.

                                         {
    initialize(); // reset all node attributes
 
    int count=0;
    Queue<MyNode> open=new Queue<MyNode>();
    s0.ord=count++;
    s0.d=0.0;
 
    showMark(s0);
 
    open.enqueue(s0);
 
    while (!open.is_empty()) {
      if (verbose>0)
        System.out.println("open="+open.toString());
 
      MyNode s=open.dequeue();
 
      showVisit(s);
 
      for (MyEdge e : g_.getOutEdges(s)) {
 
        if (verbose>0)
          System.err.println(e);
 
        MyNode t=(MyNode) e.destination();
        if (t==s)
            t=(MyNode) e.source(); // undirected graph
 
        if (t.ord<0) { // <=> not marked
          t.ord=count++;
          t.p=s;
          t.d=s.d+(e.hasWeight() ? e.getWeight() : 1.0);
 
          showMark(t);
 
          open.enqueue(t);
        }
      }
    }
  }

References aud.example.graph.MyNode.d, aud.Queue< T >.dequeue(), aud.Queue< T >.enqueue(), aud.example.graph.Traversal.initialize(), aud.Queue< T >.is_empty(), aud.example.graph.MyNode.ord, aud.example.graph.Traversal.showMark(), aud.Queue< T >.toString(), and aud.example.graph.Traversal.verbose.

Here is the call graph for this function:

---

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

• BreadthFirstSearch.java