Interface for finite graphs that embody the concept of node acceptance.
Interface for bidirectional graph.
A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.
A finite Kripke Transition System combines the properties of both a labeled transition system and a Kripke structure.
A finite LTS is an
Interface for an (indefinite) graph structure.
A labeled transition system is a graph with labels attached to its edges.
A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.
A graph that allows modification.
A graph that supports (desirably efficient) removal of nodes and edges.
The finite version of a
An undirected graph.
A universal graph, i.e., with (possibly empty) node and edge properties.
|IndefiniteSimpleGraph.NormalGraphView<N,G extends IndefiniteSimpleGraph<N>>|
|SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>|
Copyright © 2020. All rights reserved.