Satsuma.TopologicalOrder Class Reference

Decides whether a digraph is acyclic and finds a topological order of its nodes. More...

Public Types
enum	Flags { None = 0, CreateOrder = 1 << 0 }

Public Member Functions
	TopologicalOrder (IGraph graph, Flags flags=0)

Properties
bool	Acyclic [get, set]
	true if the digraph has no cycles. More...
IGraph	Graph [get, set]
	The input graph. More...
List< Node >	Order [get, set]
	An order of the nodes where each arc points forward. More...

Detailed Description

Decides whether a digraph is acyclic and finds a topological order of its nodes.

Edges count as 2-cycles.

Definition at line 174 of file Connectivity.cs.

Member Enumeration Documentation

enum Satsuma.TopologicalOrder.Flags

Enumerator
None
CreateOrder	If set, Order will contain a topological order of the nodes.

Definition at line 177 of file Connectivity.cs.

Constructor & Destructor Documentation

Satsuma.TopologicalOrder.TopologicalOrder	(	IGraph	graph,
		Flags	flags = 0
	)

Definition at line 243 of file Connectivity.cs.

Property Documentation

bool Satsuma.TopologicalOrder.Acyclic

getset

true if the digraph has no cycles.

Definition at line 187 of file Connectivity.cs.

IGraph Satsuma.TopologicalOrder.Graph

getset

The input graph.

Definition at line 185 of file Connectivity.cs.

List<Node> Satsuma.TopologicalOrder.Order

getset

An order of the nodes where each arc points forward.

Null if Flags.CreateTopologicalOrder was not set during construction. Otherwise, empty if the digraph has a cycle.

Definition at line 191 of file Connectivity.cs.

---

The documentation for this class was generated from the following file:

• src/Connectivity.cs