kosaraju

Documentation

Overview

Package kosaraju implements Kosaraju's Strongly Connected Components algorithm.

Index

• func Contains(vtx string, sl []string) bool
• func DFS(g *gsd.Graph) string
• func DFSStart(g *gsd.Graph, start *gsd.Vertex) string
• func DFSVisit(g *gsd.Graph, src *gsd.Vertex, stamp int64, result *slice.Sequence)
• func DFS_SCC(g *gsd.Graph, start *gsd.Vertex) []string
• func SCC(g, gr *gsd.Graph) [][]string

Functions

func Contains

func Contains(vtx string, sl []string) bool

Contains returns true if vtx exists in the slice sl.

func DFS

func DFS(g *gsd.Graph) string

DFS does Depth First Search and return the result in visited order.

func DFSStart

func DFSStart(g *gsd.Graph, start *gsd.Vertex) string

DFSStart performs DFS with a starting Vertex.

func DFSVisit

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

DFSVisit recursively visits the vertices in the graph.

func DFS_SCC

func DFS_SCC(g *gsd.Graph, start *gsd.Vertex) []string

DFS_SCC performs dfsSCC.

func SCC

func SCC(g, gr *gsd.Graph) [][]string

SCC returns the Strongly Connected Components using Kosaraju's algorithm.