1package aud.example.graph;
26 public abstract String
name();
38 node.d=Double.POSITIVE_INFINITY;
39 node.f=Double.POSITIVE_INFINITY;
45 node.
color=
"lightblue";
49 void showVisit(
MyNode node) {
edge with all possible attributes that we require ;-)
graph based on aud.graph.GraphAM
GraphvizDecorator getDecorator()
node with all possible attributes that we require ;-)
MyNode p
node from which node was reached (defines spanning tree)
String color
color as string
interface for traversals of MyGraph
Traversal(MyGraph g)
initiate traversal of g
abstract String name()
get traversal name
SingleStepper singlestepper
may halt if single stepper was set
int verbose
set verbosity (extra output if >0)
int nsteps
halt every nsteps steps in time_
void initialize()
initialize graph for traversal (reset all attributes), provided for convenience to be called by start
void showMark(MyNode node)
callback to give visual feedback on marking a node
abstract void start(MyNode s0)
start traversal at node s0
Edge getEdge(Node source, Node destination)
Example for a simple decorator.
Simple framework for single stepping code.
void halt(String text, int timeout)
display text and wait for user or timeout
utilities (not related to AuD lecture)
AuD lecture: Data structures, algorithms, examples.