SuccessiveShortestPaths (DMLab Library API for 0.0.4-SNAPSHOT)

java.lang.Object
- edu.gsu.cs.dmlab.graph.algo.SuccessiveShortestPaths

All Implemented Interfaces:

ITrackingGraphProblemSolver
```
public class SuccessiveShortestPaths
extends Object
implements ITrackingGraphProblemSolver
```
This class is used to find the optimal flow through the passed in SimpleDirectedWeightedGraph where some of the edges are negative and the graph is a DAG.

Author:

Dustin Kempton, Data Mining Lab, Georgia State University

Constructor Summary

Constructors
Constructor Description

SuccessiveShortestPaths()

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`List<ISTTrackingTrajectory[]>`	`solve(ITrackingGraph graph)`	Solves the optimal multi-commodity flow problem and returns a list of keys for the edges that are used in the solution.

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

- Constructor Detail
  - SuccessiveShortestPaths
```
public SuccessiveShortestPaths()
```
- Method Detail
  - solve
```
public List<ISTTrackingTrajectory[]> solve(ITrackingGraph graph)
```
    Description copied from interface: ITrackingGraphProblemSolver
    
    Solves the optimal multi-commodity flow problem and returns a list of keys for the edges that are used in the solution.
    
    Specified by:
    
    solve in interface ITrackingGraphProblemSolver
    
    Parameters:
    
    graph - The graph to solve the multi-commodity flow problem on.
    
    Returns:
    
    A list of two key pairs that represent the edges that are used in the solution. Where the first key is the head vertex of the edge and the second key is the tail vertex of the edge.