CPM (Algorithms 4/e)

Object
- edu.princeton.cs.algs4.CPM

```
public class CPM
extends 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 program takes Θ(V + E) time in the worst case, 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.

Author:

Robert Sedgewick, Kevin Wayne

Method Summary

All Methods Static Methods Concrete Methods
Modifier and Type	Method	Description
`static void`	`main(String[] args)`	Reads the precedence constraints from standard input and prints a feasible schedule to standard output.

Methods inherited from class java.lang.Object
clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Method Detail
  - main
```
public static void main(String[] args)
```
    Reads the precedence constraints from standard input and prints a feasible schedule to standard output.
    
    Parameters:
    
    args - the command-line arguments