aud.example.graph.TraversalExample Class Reference

graph traversal example More...

Inheritance diagram for aud.example.graph.TraversalExample:

Collaboration diagram for aud.example.graph.TraversalExample:

Public Member Functions
	TraversalExample ()
	create instance More...
MyGraph	graph ()
	get graph (associated with traversal ) More...
Public Member Functions inherited from aud.util.SingleStepper
	SingleStepper (JFrame parent)
	create new instance More...
	SingleStepper (String caption)
	create new instance More...
JFrame	parent ()
	get parent widget More...
void	halt (String text, int timeout)
	display text and wait for user or timeout More...
void	setTimeout (int timeout)
	Set global timeout. More...
SingleStepper	whereAmI ()
	print location of calling code More...
SingleStepper	showSource ()
	jmp to caller's location in editor (emacs only) More...
void	halt (String text)
	display text and wait for user (or global timeout) More...
void	halt ()
	wait for user More...

Static Public Member Functions
static void	main (String[] args)
	example (see also usage) More...
static void	main (String[] args)

Public Attributes
Traversal	traversal = null
	the particular traversal algorithm More...

Protected Member Functions
void	onHalt ()
Protected Member Functions inherited from aud.util.SingleStepper
JComponent	createComponents ()
void	onNext ()
	call on button pressed More...
void	println (String text)
	print to both, text area and stdout More...
void	onHalt ()

Static Protected Member Functions
static void	usage ()

Protected Attributes
DotViewer	viewer_
Protected Attributes inherited from aud.util.SingleStepper
JFrame	frame
JTextArea	history
JButton	next
Object	monitor = new Object()
int	timeout = 0

Detailed Description

graph traversal example

Definition at line 8 of file TraversalExample.java.

Constructor & Destructor Documentation

TraversalExample()

aud.example.graph.TraversalExample.TraversalExample

(

)

create instance

Definition at line 16 of file TraversalExample.java.

                            {
    super("aud.example.graph.TraversalExample");
  }

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

Here is the caller graph for this function:

Member Function Documentation

graph()

MyGraph aud.example.graph.TraversalExample.graph

(

)

get graph (associated with traversal )

Definition at line 21 of file TraversalExample.java.

{ return traversal!=null ? traversal.graph() : null; }

References aud.example.graph.TraversalExample.traversal.

Referenced by aud.example.graph.TraversalExample.main(), and aud.example.graph.TraversalExample.onHalt().

Here is the caller graph for this function:

main()

static void aud.example.graph.TraversalExample.main ( String[]  args )

static

example (see also usage)

Reimplemented from aud.util.SingleStepper.

Definition at line 42 of file TraversalExample.java.

                                         {
    MyGraph g=new MyGraph(false);
 
    File graph=null;
    String method="dfs";
    String start=null;
    String destination=null;
    int n=1;
    int verbose=0;
 
    for (int i=0;i<args.length;++i) {
      if (args[i].compareTo("-g")==0)
        graph=new File(args[++i]);
      else if (args[i].compareTo("-m")==0)
        method=args[++i];
      else if (args[i].compareTo("-s")==0)
        start=args[++i];
      else if (args[i].compareTo("-n")==0)
        n=Integer.parseInt(args[++i]);
      else if (args[i].compareTo("-v")==0)
        verbose=Integer.parseInt(args[++i]);
      else if (args[i].compareTo("-d")==0)
        destination=args[++i];
      else
        usage();
    }
 
    TraversalExample app=new TraversalExample();
 
    if (graph==null)
      g=new GraphP88(method.compareTo("dfs")!=0 && method.compareTo("bfs")!=0);
    else {
      new GraphParser(g.getAbstractGraph()).parse(graph);
    }
 
    Traversal algorithm=null;
 
    if (method.compareTo("dfs")==0)
      algorithm=new DepthFirstSearch(g);
    else if  (method.compareTo("idfs1")==0)
      algorithm=new IterativeDFS1(g);
    else if  (method.compareTo("idfs2")==0)
      algorithm=new IterativeDFS2(g);
    else if  (method.compareTo("bfs")==0)
      algorithm=new BreadthFirstSearch(g);
    else if  (method.compareTo("dijkstra")==0)
      algorithm=new DijkstraShortestPaths(g);
    else if  (method.compareTo("prim")==0)
      algorithm=new PrimMinimumSpanningTree(g);
    else if  (method.compareTo("astar")==0)
      algorithm=new AStarShortestPath(g);
 
    if (algorithm==null)
      usage();
 
    algorithm.singlestepper=app;
    algorithm.nsteps=n;
    algorithm.verbose=verbose;
 
    app.traversal=algorithm;
 
    MyNode s0=null;
    MyNode s1=null;
 
    if (start!=null) {
      for (MyNode node : g)
        if (node.getLabel().compareTo(start)==0) {
          s0=node;
          break;
        }
      if (s0==null)
        System.err.println("could not find start node s0='"+start+"'");
    }
    if (destination!=null) {
      for (MyNode node : g)
        if (node.getLabel().compareTo(destination)==0) {
          s1=node;
          break;
        }
      if (s1==null)
        System.err.println("could not find destination node s1='"+destination+"'");
    }
 
    if (s0==null)
      s0=app.graph().getSomeNode();
 
    if (method.compareTo("astar")==0) {
      if (s1==null)
        usage();
 
      s1.color="red"; // destination
 
      app.halt(algorithm.name()+" from "+s0+" to "+s1);
 
      // start traversal
      ((AStarShortestPath) algorithm).start(s0,s1);
 
      // show result from backtracking
      app.halt("shortest path");
    }
    else {
      app.halt(algorithm.name()+ " from "+s0);
 
      // start traversal
      algorithm.start(s0);
    }
 
 
    ((SimpleDecorator) app.graph().getDecorator()).highlightNode(null);
    ((SimpleDecorator) app.graph().getDecorator()).highlightEdge(null);
 
    app.halt("DONE");
 
    System.out.println(app.graph());
 
    System.exit(0);
  }

References aud.example.graph.MyNode.color, aud.example.graph.MyGraph.getAbstractGraph(), aud.example.graph.MyGraph.getDecorator(), aud.graph.GraphAM< Node extends AbstractNode, Edge extends AbstractEdge >.getSomeNode(), aud.example.graph.TraversalExample.graph(), aud.util.SingleStepper.halt(), aud.example.graph.Traversal.name(), aud.example.graph.Traversal.nsteps, aud.example.graph.GraphParser.parse(), aud.example.graph.Traversal.singlestepper, aud.example.graph.Traversal.start(), aud.example.graph.TraversalExample.traversal, aud.example.graph.TraversalExample.TraversalExample(), aud.example.graph.TraversalExample.usage(), and aud.example.graph.Traversal.verbose.

Here is the call graph for this function:

onHalt()

void aud.example.graph.TraversalExample.onHalt ( )

protected

Reimplemented from aud.util.SingleStepper.

Definition at line 23 of file TraversalExample.java.

                                    {
    if (graph()!=null)
      viewer_.display(graph());
  }

References aud.util.DotViewer.display(), aud.example.graph.TraversalExample.graph(), and aud.example.graph.TraversalExample.viewer_.

Here is the call graph for this function:

usage()

static void aud.example.graph.TraversalExample.usage ( )

staticprotected

Definition at line 28 of file TraversalExample.java.

                                {
    System.err.println(
          "java aud.example.graph.TraversalExample "+
          "[-g graphfile] [-m method] [-s s0] [-d s1] [-v N]\n"+
          " -g FILE read graph from FILE\n"+
          " -m METHOD traversal {dfs,idfs1,idfs2,bfs,dijkstra,prim,astar}\n"+
          " -s START start node\n"+
          " -n N show result of every n-th step\n"+
          " -v V set verbose level (extra output)\n"+
          " -d DESTINATION destination required for A* algorithm\n");
    System.exit(-1);
  }

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

Here is the caller graph for this function:

Member Data Documentation

traversal

Traversal aud.example.graph.TraversalExample.traversal = null

the particular traversal algorithm

Definition at line 13 of file TraversalExample.java.

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

viewer_

DotViewer aud.example.graph.TraversalExample.viewer_

protected

Initial value:

= DotViewer.displayWindow
    ((String) null,"aud.example.graph.TraversalExample")

Definition at line 9 of file TraversalExample.java.

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

---

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

• TraversalExample.java