![]() |
AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
|
graph based on aud.graph.GraphAM
More...
Public Member Functions | |
MyGraph (boolean directed) | |
create empty graph More... | |
MyGraph (boolean directed, File filename) | |
read graph from file using GraphParser More... | |
AbstractGraph< AbstractNode, AbstractEdge > | getAbstractGraph () |
view this graph as an AbstractGraph More... | |
GraphvizDecorator | getDecorator () |
![]() | |
GraphAM (Node nodeGenerator, Edge edgeGenerator, boolean directed) | |
Create graph. More... | |
boolean | isDirected () |
Node | addNode () |
Edge | addEdge (Node source, Node destination) |
int | getNumNodes () |
Node | getSomeNode () |
Iterator< Node > | iterator () |
Edge | getEdge (Node source, Node destination) |
Vector< Edge > | getInEdges (Node node) |
Vector< Edge > | getOutEdges (Node node) |
void | removeNode (Node node) |
void | removeEdge (Edge edge) |
Iterator< Edge > | getEdgeIterator () |
Additional Inherited Members | |
![]() | |
Node | check (Node node) |
Edge | check (Edge edge) |
aud.example.graph.MyGraph.MyGraph | ( | boolean | directed | ) |
create empty graph
Definition at line 16 of file MyGraph.java.
aud.example.graph.MyGraph.MyGraph | ( | boolean | directed, |
File | filename | ||
) |
read graph from file using GraphParser
Definition at line 20 of file MyGraph.java.
References aud.example.graph.MyGraph.getAbstractGraph(), aud.example.graph.GraphParser.parse(), and aud.util.Sys.readFile().
AbstractGraph< AbstractNode, AbstractEdge > aud.example.graph.MyGraph.getAbstractGraph | ( | ) |
view this graph as an AbstractGraph
Definition at line 29 of file MyGraph.java.
Referenced by aud.example.graph.RetroMaze.main(), aud.example.graph.TraversalExample.main(), and aud.example.graph.MyGraph.MyGraph().
GraphvizDecorator aud.example.graph.MyGraph.getDecorator | ( | ) |
Definition at line 34 of file MyGraph.java.
Referenced by aud.example.graph.TraversalExample.main().