Hierarchy For All Packages

Package Hierarchies:

• net.automatalib.util.automata,
• net.automatalib.util.automata.asgraph,
• net.automatalib.util.automata.copy,
• net.automatalib.util.automata.equivalence,
• net.automatalib.util.automata.fsa,
• net.automatalib.util.automata.random,
• net.automatalib.util.graphs,
• net.automatalib.util.graphs.concepts,
• net.automatalib.util.graphs.copy,
• net.automatalib.util.graphs.dot,
• net.automatalib.util.graphs.traversal,
• net.automatalib.util.minimizer,
• net.automatalib.util.traversal,
• net.automatalib.util.tries,
• net.automatalib.util.ts,
• net.automatalib.util.ts.acceptors,
• net.automatalib.util.ts.traversal

Class Hierarchy

• java.lang.Object
  • java.util.AbstractCollection<E> (implements java.util.Collection<E>)
    • java.util.AbstractList<E> (implements java.util.List<E>)
      • net.automatalib.util.graphs.Path<N,E>
  • net.automatalib.graphs.abstractimpl.AbstractIndefiniteGraph<N,E> (implements net.automatalib.graphs.IndefiniteGraph<N,E>)
    • net.automatalib.graphs.abstractimpl.AbstractGraph<N,E> (implements net.automatalib.graphs.Graph<N,E>)
      • net.automatalib.util.tries.SuffixTrie<I> (implements net.automatalib.graphs.dot.DOTPlottableGraph<N,E>)
        • net.automatalib.util.tries.SharedSuffixTrie<I>
  • net.automatalib.commons.util.strings.AbstractPrintable (implements net.automatalib.commons.util.strings.Printable)
    • net.automatalib.words.Word<I> (implements net.automatalib.commons.util.array.ArrayWritable<T>, java.lang.Iterable<T>)
      • net.automatalib.util.tries.SuffixTrieNode<I>
  • net.automatalib.util.automata.random.AbstractRandomAutomatonGenerator<S,I,T,SP,TP,A>
    • net.automatalib.util.automata.random.RandomDeterministicAutomatonGenerator<S,I,T,SP,TP,A>
  • net.automatalib.ts.abstractimpl.AbstractTS<S,I,T> (implements net.automatalib.ts.TransitionSystem<S,I,T>)
    • net.automatalib.ts.abstractimpl.AbstractDTS<S,I,T> (implements net.automatalib.ts.DeterministicTransitionSystem<S,I,T>)
      • net.automatalib.ts.comp.DTSComposition<S1,S2,I,T1,T2,TS1,TS2>
        • net.automatalib.util.ts.acceptors.DetAcceptorComposition<S1,S2,I,A1,A2> (implements net.automatalib.ts.acceptors.DeterministicAcceptorTS<S,I>)
  • net.automatalib.util.ts.acceptors.Acceptors
  • net.automatalib.util.automata.asgraph.AGHelper
  • net.automatalib.util.automata.asgraph.AutomatonAsGraph<S,I,T,A> (implements net.automatalib.graphs.Graph<N,E>)
    • net.automatalib.util.automata.asgraph.UniversalAutomatonAsGraph<S,I,T,SP,TP,A> (implements net.automatalib.graphs.UniversalGraph<N,E,NP,EP>)
  • net.automatalib.util.automata.copy.AutomatonCopy
  • net.automatalib.util.graphs.traversal.BaseDFSVisitor<N,E,D> (implements net.automatalib.util.graphs.traversal.DFSVisitor<N,E,D>)
  • net.automatalib.commons.smartcollections.BasicLinkedListEntry<E,T> (implements net.automatalib.commons.smartcollections.LinkedListEntry<E,T>)
    • net.automatalib.util.minimizer.Block<S,L>
  • net.automatalib.util.ts.traversal.BFSOrderIterator<S,I> (implements java.util.Iterator<E>)
  • net.automatalib.util.minimizer.BlockAutomaton<S,L>
  • net.automatalib.util.minimizer.BlockEdge<S,L>
  • net.automatalib.util.minimizer.BlockMap<V> (implements net.automatalib.commons.util.mappings.MutableMapping<D,R>)
  • net.automatalib.util.automata.equivalence.CharacterizingSets
  • net.automatalib.util.graphs.traversal.DefaultGraphTraversalVisitor<N,E,D> (implements net.automatalib.util.graphs.traversal.GraphTraversalVisitor<N,E,D>)
  • net.automatalib.util.automata.equivalence.DeterministicEquivalenceTest<I>
  • net.automatalib.util.automata.fsa.DFAs
  • net.automatalib.util.ts.traversal.DFRecord<S,I,T,D>
  • net.automatalib.util.graphs.copy.GraphCopy
  • net.automatalib.util.graphs.dot.GraphDOT
  • net.automatalib.util.graphs.Graphs
  • net.automatalib.util.graphs.traversal.GraphTraversal
  • net.automatalib.util.minimizer.MinimizationResult<S,L>
  • net.automatalib.util.minimizer.Minimizer<S,L>
  • net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest<I>
  • net.automatalib.util.automata.fsa.NFAs
  • net.automatalib.util.graphs.OutEdgesMapping<N,E> (implements net.automatalib.commons.util.mappings.Mapping<D,R>)
  • net.automatalib.util.graphs.Path.PathData<N,E>
  • net.automatalib.util.graphs.concepts.PropertyEdgeWeights<E> (implements net.automatalib.graphs.concepts.EdgeWeights<E>)
  • net.automatalib.util.automata.random.RandomAutomata
  • net.automatalib.util.ts.TS
    • net.automatalib.util.automata.Automata
  • net.automatalib.util.ts.TS.TransRef<S,I>
  • net.automatalib.util.ts.traversal.TSTraversal

Interface Hierarchy

• net.automatalib.util.ts.acceptors.AcceptanceCombiner
• net.automatalib.util.graphs.traversal.DFSVisitor<N,E,D>
• net.automatalib.util.graphs.traversal.GraphTraversalVisitor<N,E,D>
• net.automatalib.util.ts.traversal.TSTraversalVisitor<S,I,T,D>

Enum Hierarchy

• java.lang.Object
  • java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable)
    • net.automatalib.util.ts.traversal.TSTraversalAction
    • net.automatalib.util.traversal.TraversalOrder
    • net.automatalib.util.traversal.VisitedState
    • net.automatalib.util.traversal.Color
    • net.automatalib.util.graphs.traversal.GraphTraversalAction