C# 클래스 TopologicalSorting.DependencyGraph

A graph of processes and resources from which a topological sort can be extracted

공개 메소드들

메소드	설명
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

메소드	설명
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

Calculates the sort which results from this dependency network

Thrown if no sort exists for the given set of constraints

public CalculateSort ( ) : TopologicalSort
리턴	TopologicalSort

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

public CalculateSort ( TopologicalSort instance ) : TopologicalSort
instance	TopologicalSort	The instance.
리턴	TopologicalSort