Package aud.example.graph

demos of graph algorithms More...

Classes
class	AStarShortestPath
	implementation of the A* algorithm More...
class	BreadthFirstSearch
	implements BFS More...
class	DepthFirstSearch
	Standard recursive implementation of depth first search. More...
class	DijkstraShortestPaths
	implements Dijkstra's algorithm by defining priority More...
class	GraphP88
	undirected (weighted or unweighted )example graph (Sedgewick, Algorithms in Java. More...
class	GraphParser
	Parse text to build graph. More...
class	IterativeDFS1
	Iterative implementation of DFS. More...
class	IterativeDFS2
	iterative implementation of DFS Traversal like DepthFirstSearch but as for IterativeDFS1 the order of processed edges differs and nodes are marked before being pushed. More...
class	MaxFlowExample
	Example for computing the maximum flow using a Ford-Fulkerson type algorithm. More...
class	MyDecorator
class	MyEdge
	edge with all possible attributes that we require ;-) More...
class	MyGraph
	graph based on aud.graph.GraphAM More...
class	MyNode
	node with all possible attributes that we require ;-) More...
class	PrimMinimumSpanningTree
	implements Prim's algorithm by defining priority More...
class	PriorityFirstSearch
	Priority first search implementation. More...
class	RetroMaze
	a really simple game, which lets you explore a maze... pardon: a graph More...
class	Tokenizer
	Breaks input string into pieces ("tokens"). More...
class	Traversal
	interface for traversals of MyGraph More...
class	TraversalExample
	graph traversal example More...

Detailed Description

demos of graph algorithms

• MyGraph with MyNode and MyEdge implement a graph with all attributes that are required by algorithms/visualization
• Traversal provides a base class for implementation of various graph traversal algorithms (see subclasses)
• TraversalExample provides a test framework for graph traversals
• GraphParser reads graphs from text files (see *.graph files), alternatively you can build build graphs algorithmically such as GraphP88