The highest tagged major version is v10.

toposort

package

v9.3.0 Latest Latest Go to latest Published: Mar 17, 2019 License: Apache-2.0 Imports: 4 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/src-d/hercules

Links

Open Source Insights

Documentation ¶

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type Graph ¶

type Graph struct {
	// contains filtered or unexported fields
}

Graph represents a directed acyclic graph.

func NewGraph ¶

func NewGraph() *Graph

NewGraph initializes a new Graph.

func (*Graph) AddEdge ¶

func (g *Graph) AddEdge(from, to string) int

AddEdge inserts the link from "from" node to "to" node.

func (*Graph) AddNode ¶

func (g *Graph) AddNode(name string) bool

AddNode inserts a new node into the graph.

func (*Graph) AddNodes ¶

func (g *Graph) AddNodes(names ...string) bool

AddNodes inserts multiple nodes into the graph at once.

func (*Graph) BreadthSort ¶

func (g *Graph) BreadthSort() []string

BreadthSort sorts the nodes in the graph in BFS order.

func (*Graph) Copy ¶

func (g *Graph) Copy() *Graph

Copy clones the graph and returns the independent copy.

func (*Graph) DebugDump ¶

func (g *Graph) DebugDump() string

DebugDump converts the graph to a string. As the name suggests, useful for debugging.

func (*Graph) FindChildren ¶

func (g *Graph) FindChildren(from string) []string

FindChildren returns the other ends of outgoing edges.

func (*Graph) FindCycle ¶

func (g *Graph) FindCycle(seed string) []string

FindCycle returns the cycle in the graph which contains "seed" node.

func (*Graph) FindParents ¶

func (g *Graph) FindParents(to string) []string

FindParents returns the other ends of incoming edges.

func (*Graph) ReindexNode ¶

func (g *Graph) ReindexNode(node string)

ReindexNode updates the internal representation of the node after edge removals.

func (*Graph) RemoveEdge ¶

func (g *Graph) RemoveEdge(from, to string) bool

RemoveEdge deletes the link from "from" node to "to" node. Call ReindexNode(from) after you finish modifying the edges.

func (*Graph) Serialize ¶

func (g *Graph) Serialize(sorted []string) string

Serialize outputs the graph in Graphviz format.

func (*Graph) Toposort ¶

func (g *Graph) Toposort() ([]string, bool)

Toposort sorts the nodes in the graph in topological order.

Source Files ¶

View all Source files

toposort.go

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL