tsdag

Documentation

Overview

Package tsdag finds the topological sort.

Index

• func DFSVisit(g *gsd.Graph, src *gsd.Vertex, stamp int64, result *slice.Sequence, ...)
• func TSDAG(g *gsd.Graph) (string, bool)

Functions

func DFSVisit

func DFSVisit(g *gsd.Graph, src *gsd.Vertex, stamp int64, result *slice.Sequence, exist *bool)

DFSVisit recursively visits the vertices in the graph. And it ends when it finds a cycle in a graph.

func TSDAG

func TSDAG(g *gsd.Graph) (string, bool)

TSDAG returns topological sort using DFS. It returns false if there is a cycle which means that there is no topological sort.