datastructures

Datastructures

The datastructues package provides a way to describe a graph. Each graph class represent a way of how the graph is represented in memory, but also can limit the way vertices and edges are in relationship (e.g. a bipartite graph like a petri net that has to stay bipartite). Every graph class comes with classes for its vertice and edge maps. Thus, these map classes will be efficient to the underlying graph datastructure.

Here we will provide a list of available datastructures and their implemented interfaces. To have an introduction of how to read and write a graph see the [interfaces] section.
Following graph classes exist:

• AdjListGraph implements Graph<AdjListGraph.Vertice, AdjListGraph.Edge>
  This is a simple graph having one adjecency list.
• BiAdjListGraph implements Graph<BiAdjListGraph.Vertice, BiAdjListGraph.Edge>
  A graph using two adjecency lists. One for successors and one for predecessors.
• UAdjListGraph implements Graph<UAdjListGraph.Vertice, UAdjListGraph.Edge>
  Representing an undirected graph using one adjecency list.