| Package | Description |
|---|---|
| net.automatalib.automata |
This package contains the basic interfaces for automata.
|
| net.automatalib.automata.fsa | |
| net.automatalib.automata.graphs | |
| net.automatalib.automata.transout | |
| net.automatalib.graphs | |
| net.automatalib.graphs.ads | |
| net.automatalib.graphs.concepts | |
| net.automatalib.graphs.helpers |
| Class and Description |
|---|
| Graph
Graph interface.
|
| UniversalGraph |
| Class and 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 a
IndefiniteSimpleGraph. |
| UniversalGraph |
| UniversalIndefiniteGraph
A universal graph, i.e., with (possibly empty) node and edge properties.
|
| Class and 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 a
IndefiniteSimpleGraph. |
| UniversalGraph |
| UniversalIndefiniteGraph
A universal graph, i.e., with (possibly empty) node and edge properties.
|
| Class and 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 a
IndefiniteSimpleGraph. |
| UniversalGraph |
| UniversalIndefiniteGraph
A universal graph, i.e., with (possibly empty) node and edge properties.
|
| Class and Description |
|---|
| FiniteKripkeStructure
A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.
|
| FiniteLTS
A finite LTS is an
IndefiniteLTS with a finite number of nodes. |
| Graph
Graph interface.
|
| IndefiniteGraph
Interface for an (indefinite) graph structure.
|
| IndefiniteLTS
A labeled transition system is a graph with labels attached to its edges.
|
| IndefiniteSimpleGraph
A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about
edge objects.
|
| IndefiniteSimpleGraph.NormalGraphView |
| SimpleGraph
The finite version of a
IndefiniteSimpleGraph. |
| UniversalGraph |
| UniversalIndefiniteGraph
A universal graph, i.e., with (possibly empty) node and edge properties.
|
| Class and 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 a
IndefiniteSimpleGraph. |
| Class and Description |
|---|
| Graph
Graph interface.
|
| Class and Description |
|---|
| SimpleGraph
The finite version of a
IndefiniteSimpleGraph. |
Copyright © 2018. All rights reserved.