Interface  Description 

AcceptanceGraph<N,E> 
Interface for finite graphs that embody the concept of node acceptance.

BidirectionalGraph<N,E> 
Interface for bidirectional graph.

FiniteKripkeStructure<N,E,AP> 
A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.

FiniteKTS<N,E,AP,L> 
A finite Kripke Transition System combines the properties of both a labeled transition system and a Kripke
structure.

FiniteLTS<N,E,L> 
A finite LTS is an
IndefiniteLTS with a finite number of nodes. 
Graph<N,E> 
Graph interface.

IndefiniteGraph<N,E> 
Interface for an (indefinite) graph structure.

IndefiniteLTS<N,E,L> 
A labeled transition system is a graph with labels attached to its edges.

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.

ShrinkableGraph<N,E> 
A graph that supports (desirably efficient) removal of nodes and edges.

SimpleGraph<N> 
The finite version of a
IndefiniteSimpleGraph . 
UndirectedGraph<N,E> 
An undirected graph.

UniversalGraph<N,E,NP,EP>  
UniversalIndefiniteGraph<N,E,NP,EP> 
A universal graph, i.e., with (possibly empty) node and edge properties.

Class  Description 

IndefiniteSimpleGraph.NormalGraphView<N,G extends IndefiniteSimpleGraph<N>>  
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>> 
Copyright © 2020. All rights reserved.