Uses of Package
net.automatalib.graph
-
Packages that use net.automatalib.graph Package Description net.automatalib.automaton This package (including sub-packages) contains the basic classes concerning automata.net.automatalib.automaton.fsa net.automatalib.automaton.graph net.automatalib.automaton.procedural net.automatalib.automaton.transducer net.automatalib.automaton.vpa net.automatalib.graph This package (including sub-packages) contains the basic classes concerning graphs.net.automatalib.graph.ads net.automatalib.graph.concept net.automatalib.graph.helper net.automatalib.graph.visualization net.automatalib.ts.modal -
Classes in net.automatalib.graph used by net.automatalib.automaton Class Description Graph Graph interface.UniversalGraph -
Classes in net.automatalib.graph used by net.automatalib.automaton.fsa Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
.UniversalGraph UniversalIndefiniteGraph A universal graph, i.e., with (possibly empty) node and edge properties. -
Classes in net.automatalib.graph used by net.automatalib.automaton.graph Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
.UniversalGraph UniversalIndefiniteGraph A universal graph, i.e., with (possibly empty) node and edge properties. -
Classes in net.automatalib.graph used by net.automatalib.automaton.procedural Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
. -
Classes in net.automatalib.graph used by net.automatalib.automaton.transducer Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
.UniversalGraph UniversalIndefiniteGraph A universal graph, i.e., with (possibly empty) node and edge properties. -
Classes in net.automatalib.graph used by net.automatalib.automaton.vpa Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
. -
Classes in net.automatalib.graph used by net.automatalib.graph Class Description BidirectionalGraph Interface for bidirectional graph.FiniteKripkeStructure A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.FiniteLabeledGraph Graph Graph interface.Graph.IntAbstraction Interface fornode integer abstractions
of aGraph
.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.MutableGraph A graph that allows modification.ProceduralModalProcessGraph Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.SimpleGraph The finite version of aIndefiniteSimpleGraph
.SimpleGraph.IntAbstraction Basic interface for integer abstractions of graphs.UniversalBidirectionalGraph UniversalGraph UniversalGraph.IntAbstraction Interface fornode integer abstractions
of aUniversalGraph
.UniversalIndefiniteGraph A universal graph, i.e., with (possibly empty) node and edge properties. -
Classes in net.automatalib.graph used by net.automatalib.graph.ads Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
. -
Classes in net.automatalib.graph used by net.automatalib.graph.concept Class Description Graph Graph interface. -
Classes in net.automatalib.graph used by net.automatalib.graph.helper Class Description SimpleGraph The finite version of aIndefiniteSimpleGraph
. -
Classes in net.automatalib.graph used by net.automatalib.graph.visualization Class Description ProceduralModalProcessGraph Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking. -
Classes in net.automatalib.graph used by net.automatalib.ts.modal Class Description Graph Graph interface.IndefiniteGraph Interface for an (indefinite) graph structure.IndefiniteSimpleGraph A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.SimpleGraph The finite version of aIndefiniteSimpleGraph
.UniversalGraph UniversalIndefiniteGraph A universal graph, i.e., with (possibly empty) node and edge properties.