ITrackingGraphProblemSolver (DMLab Library API for 0.0.4-SNAPSHOT)

All Known Implementing Classes:

SuccessiveShortestPaths
```
public interface ITrackingGraphProblemSolver
```
This interface is for classes that find the optimal multi-commodity 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

Method Summary

All Methods Instance Methods Abstract 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.

- Method Detail
  - solve
```
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.
    
    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.