TopologicalSort Class

Class performing a topological sort of a directed acyclic graph.

A topological sort is a linear ordering of the vertices such that if the graph contains and edge from u to v (v "depends on" u), then u appears before v in the ordering.

If the graph is cyclic, the sort procedure fails with an GraphException.

Inheritance Hierarchy

SystemObject
DHI.Mike1D.Generic.GraphTopologicalSort

Namespace: DHI.Mike1D.Generic.Graph
Assembly: DHI.Mike1D.Generic (in DHI.Mike1D.Generic.dll) Version: 16.0.0.0 (11.1.1.1111)

Syntax

Copy

public class TopologicalSort

The TopologicalSort type exposes the following members.

Constructors

	Name	Description
	TopologicalSort	Create a new Topological sort class performing its sort on the provided graph

Top

Properties

	Name	Description
	Order	Vertices sorted in topological order. The vector contains vertex indices.

Top

Methods

	Name	Description
	Equals	Determines whether the specified object is equal to the current object. (Inherited from Object.)
	Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.)
	GetHashCode	Serves as a hash function for a particular type. (Inherited from Object.)
	GetType	Gets the Type of the current instance. (Inherited from Object.)
	MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object.)
	Sort	Perform the topological sort.
	ToString	Returns a string that represents the current object. (Inherited from Object.)

Top

Reference

DHI.Mike1D.Generic.Graph Namespace