Package net.automatalib.graph
This package (including subpackages) contains the basic classes concerning graphs.

Interface Summary Interface Description AcceptanceGraph<N,E> Interface for finite graphs that embody the concept of node acceptance.BidirectionalGraph<N,E> Interface for bidirectional graph.BidirectionalGraph.IntAbstraction<E> Interface fornode integer abstractions
of aBidirectionalGraph
.ContextFreeModalProcessSystem<L,AP> Represents a ContextFree Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.FiniteKripkeStructure<N,E,AP> A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.FiniteLabeledGraph<N,E,L> Graph<N,E> Graph interface.Graph.IntAbstraction<E> Interface fornode integer abstractions
of aGraph
.IndefiniteGraph<N,E> Interface for an (indefinite) graph structure.IndefiniteSimpleGraph<N> A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.MutableGraph<N,E,NP,EP> A graph that allows modification.MutableGraph.IntAbstraction<E,NP,EP> Interface fornode integer abstractions
of aMutableGraph
.MutableProceduralModalProcessGraph<N,L,E,AP,TP extends MutableProceduralModalEdgeProperty> A mutable version of theProceduralModalProcessGraph
.MutableUniversalBidirectionalGraph<N,E,NP,EP> ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty> Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.ShrinkableGraph<N,E> A graph that supports (desirably efficient) removal of nodes and edges.SimpleGraph<N> The finite version of aIndefiniteSimpleGraph
.SimpleGraph.IntAbstraction Basic interface for integer abstractions of graphs.UndirectedGraph<N,E> An undirected graph.UniversalBidirectionalGraph<N,E,NP,EP> UniversalGraph<N,E,NP,EP> UniversalGraph.IntAbstraction<E,NP,EP> Interface fornode integer abstractions
of aUniversalGraph
.UniversalIndefiniteGraph<N,E,NP,EP> A universal graph, i.e., with (possibly empty) node and edge properties. 
Class Summary Class Description CFMPSGraphView<N,L,E,AP> Graph representation of aContextFreeModalProcessSystem
that displays all nodes of its subprocedures once, i.e., without incorporating execution semantics such as expansion.CompactBidiGraph<NP,EP> CompactGraph<NP,EP> CompactPMPG<L,AP> CompactPMPGEdge<L,EP> CompactSimpleBidiGraph<EP> CompactSimpleGraph<EP> DefaultCFMPS<L,AP> SimpleMapGraph<N> A very simple graph realization, where nodes can be arbitrary Java objects.