Documentation of 'edu.princeton.cs.algs4.DepthFirstDirectedPaths' Java class
DepthFirstDirectedPaths
edu.princeton.cs.algs4

Class DepthFirstDirectedPaths



  • public class DepthFirstDirectedPaths
    extends java.lang.Object
    The DepthFirstDirectedPaths class represents a data type for finding directed paths from a source vertex s to every other vertex in the digraph.

    This implementation uses depth-first search. The constructor takes time proportional to V + E, where V is the number of vertices and E is the number of edges. Each call to hasPathTo(int) takes constant time; each call to pathTo(int) takes time proportional to the length of the path returned. It uses extra space (not including the graph) proportional to V.

    For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

    • Constructor Summary

      Constructors 
      Constructor and Description
      DepthFirstDirectedPaths(Digraph G, int s)
      Computes a directed path from s to every other vertex in digraph G.
    • Method Summary

      All Methods Static Methods Instance Methods Concrete Methods 
      Modifier and Type Method and Description
      boolean hasPathTo(int v)
      Is there a directed path from the source vertex s to vertex v?
      static void main(java.lang.String[] args)
      Unit tests the DepthFirstDirectedPaths data type.
      java.lang.Iterable<java.lang.Integer> pathTo(int v)
      Returns a directed path from the source vertex s to vertex v, or null if no such path.
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • DepthFirstDirectedPaths

        public DepthFirstDirectedPaths(Digraph G,
                                       int s)
        Computes a directed path from s to every other vertex in digraph G.
        Parameters:
        G - the digraph
        s - the source vertex
        Throws:
        java.lang.IllegalArgumentException - unless 0 <= s < V
    • Method Detail

      • hasPathTo

        public boolean hasPathTo(int v)
        Is there a directed path from the source vertex s to vertex v?
        Parameters:
        v - the vertex
        Returns:
        true if there is a directed path from the source vertex s to vertex v, false otherwise
        Throws:
        java.lang.IllegalArgumentException - unless 0 <= v < V
      • pathTo

        public java.lang.Iterable<java.lang.Integer> pathTo(int v)
        Returns a directed path from the source vertex s to vertex v, or null if no such path.
        Parameters:
        v - the vertex
        Returns:
        the sequence of vertices on a directed path from the source vertex s to vertex v, as an Iterable
        Throws:
        java.lang.IllegalArgumentException - unless 0 <= v < V
      • main

        public static void main(java.lang.String[] args)
        Unit tests the DepthFirstDirectedPaths data type.
        Parameters:
        args - the command-line arguments

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.