digraph

Documentation

Overview

Package digraph implements a directed graph.

Index

• type Digraph
  • func (g Digraph) AddEdge(i, j int)
  • func (g Digraph) ClearVisited()
  • func (g Digraph) PostOrder() []int
  • func (g Digraph) Reverse() Digraph
  • func (g Digraph) SCCs() [][]int

Types

type Digraph

type Digraph []graphNode

Digraph is a directed graph.

func (Digraph) AddEdge

func (g Digraph) AddEdge(i, j int)

AddEdge adds a directed edge from node i to j.

func (Digraph) ClearVisited

func (g Digraph) ClearVisited()

ClearVisited resets the visited flags.

func (Digraph) PostOrder

func (g Digraph) PostOrder() []int

PostOrder traverses the graph with depth first search and returns the post-order traversal numbers.

func (Digraph) Reverse

func (g Digraph) Reverse() Digraph

Reverse creates the reverse graph of g.

func (Digraph) SCCs

func (g Digraph) SCCs() [][]int

SCCs computes the strongly connected components of a graph.