1package aud.example.graph;
20 public MyGraph(
boolean directed,File filename) {
27 @SuppressWarnings(
"unchecked")
Parse text to build graph.
void parse(String input)
parse input
edge with all possible attributes that we require ;-)
graph based on aud.graph.GraphAM
MyGraph(boolean directed, File filename)
read graph from file using GraphParser
MyGraph(boolean directed)
create empty graph
GraphvizDecorator getDecorator()
AbstractGraph< AbstractNode, AbstractEdge > getAbstractGraph()
view this graph as an AbstractGraph
node with all possible attributes that we require ;-)
Interface to edges of a graph.
Interface to nodes of a graph.
Graph implementation based on adjacency matrix.
Decorator for items of Graphvizable objects.
System related utilities.
static String readFile(File file)
read entire file and return contents as String
Graph data structures and algorithms.
utilities (not related to AuD lecture)
AuD lecture: Data structures, algorithms, examples.