kahnsort

Documentation

Overview

Package kahnsort provides topological sorting using Kahn's algorithm.

Index

• type Node
  • func Sort(start []Node) []Node

Types

type Node

type Node interface {
	// Down returns a list of downstream nodes adjacent to this node.
	// The list of adjacent nodes cannot have duplicates.
	Down() []Node
}

Node represents a node in a directed acyclic graph. Node implementations must be comparable using go equality.

func Sort

func Sort(start []Node) []Node

Sort computes a topological sorting of a downstream-directed acyclic graph. The set of starting nodes must be maximal in topological order.