C# Class TopologicalSorting.DependencyGraph

A graph of processes and resources from which a topological sort can be extracted
ファイルを表示 Open project: martindevans/TopologicalSorting Class Usage Examples

Public Methods

Method Description
CalculateSort ( ) : TopologicalSort

Calculates the sort which results from this dependency network
CalculateSort ( TopologicalSort instance ) : TopologicalSort

Append the result of this dependency graph to the end of the given sorting solution

Private Methods

Method Description
Add ( OrderedProcess orderedProcess ) : bool
Add ( Resource resourceClass ) : bool
CheckGraph ( OrderedProcess a, OrderedProcess b ) : void
CheckGraph ( Resource a, OrderedProcess b ) : void
SolveResourceDependencies ( ISet processes ) : IEnumerable>

Given a set of processes which are not interdependent, split up into multiple sets which do not use the same resource concurrently

Method Details

CalculateSort() public method

Calculates the sort which results from this dependency network
Thrown if no sort exists for the given set of constraints
public CalculateSort ( ) : TopologicalSort
return TopologicalSort

CalculateSort() public method

Append the result of this dependency graph to the end of the given sorting solution
public CalculateSort ( TopologicalSort instance ) : TopologicalSort
instance TopologicalSort The instance.
return TopologicalSort