Versions in this module Expand all Collapse all v0 v0.0.6-ctx-cancel Aug 5, 2020 v0.0.1 Aug 16, 2019 Changes in this version + func BronKerbosch(g graph.Undirected) [][]graph.Node + func CliqueGraph(dst Builder, g graph.Undirected) + func ConnectedComponents(g graph.Undirected) [][]graph.Node + func DegeneracyOrdering(g graph.Undirected) (order []graph.Node, cores [][]graph.Node) + func DirectedCyclesIn(g graph.Directed) [][]graph.Node + func IsPathIn(g graph.Graph, path []graph.Node) bool + func KCore(k int, g graph.Undirected) []graph.Node + func PathExistsIn(g graph.Graph, from, to graph.Node) bool + func Sort(g graph.Directed) (sorted []graph.Node, err error) + func SortStabilized(g graph.Directed, order func([]graph.Node)) (sorted []graph.Node, err error) + func TarjanSCC(g graph.Directed) [][]graph.Node + func UndirectedCyclesIn(g graph.Undirected) [][]graph.Node + type Builder interface + AddNode func(graph.Node) + SetEdge func(graph.Edge) + type Clique struct + func (n Clique) ID() int64 + func (n Clique) Nodes() []graph.Node + type CliqueGraphEdge struct + func (e CliqueGraphEdge) From() graph.Node + func (e CliqueGraphEdge) Nodes() []graph.Node + func (e CliqueGraphEdge) ReversedEdge() graph.Edge + func (e CliqueGraphEdge) To() graph.Node + type Unorderable [][]graph.Node + func (e Unorderable) Error() string