Package it.unive.tarsis.automata.algorithms

Class PathExtractor

  • public class PathExtractor
extends java.lang.Object
    An algorithm that extracts paths from an automaton.

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      java.util.Set<java.util.List<State>> getAllPaths()
      Yields all possible paths going from an initial state to a final state in the target automaton.
      java.util.List<State> minimumDijkstra​(State src, State target)
      Finds the minimum path between the two given states using the Dijkstra algorithm.

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Constructor Detail

      • PathExtractor

        public PathExtractor​(Automaton a)
        Builds the extractor.
        Parameters:
        a - the automaton

    • Method Detail

      • getAllPaths

        public java.util.Set<java.util.List<State>> getAllPaths()
        Yields all possible paths going from an initial state to a final state in the target automaton. Note that each node of an SCC of the automaton will appear at most once in each path.
        Returns:
        the set of all possible paths

      • minimumDijkstra

        public java.util.List<State> minimumDijkstra​(State src,
                                             State target)
        Finds the minimum path between the two given states using the Dijkstra algorithm.
        Parameters:
        src - the source node
        target - the destination node
        Returns:
        the minimum path