程序包 edu.princeton.cs.algs4

类 CPM

  • public class CPM
extends java.lang.Object
    The CPM class provides a client that solves the parallel precedence-constrained job scheduling problem via the critical path method. It reduces the problem to the longest-paths problem in edge-weighted DAGs. It builds an edge-weighted digraph (which must be a DAG) from the job-scheduling problem specification, finds the longest-paths tree, and computes the longest-paths lengths (which are precisely the start times for each job).

    This implementation uses AcyclicLP to find a longest path in a DAG. The running time is proportional to V + E, where V is the number of jobs and E is the number of precedence constraints.

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

    • 方法概要

      修饰符和类型 方法 说明
      static void main​(java.lang.String[] args)
      Reads the precedence constraints from standard input and prints a feasible schedule to standard output.

      • 从类继承的方法 java.lang.Object

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

    • 方法详细资料

      • main

        public static void main​(java.lang.String[] args)
        Reads the precedence constraints from standard input and prints a feasible schedule to standard output.
        参数:
        args - the command-line arguments