graph

package

v0.1.0 Latest Latest Go to latest Published: Dec 6, 2015 License: MIT Imports: 3 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

This section is empty.

This section is empty.

This section is empty.

type DAG struct {
	Root      *Vertex
	Adjacency map[*Vertex]*list.List
}

DAG is a Directed Acyclic Graph implemented with an adjacency list.

func NewDAG(v interface{}) *DAG

NewDAG constructs a new graph with a single root vertex.

func (g *DAG) Add(v interface{}) *Vertex

Add inserts a vertex holding a value v in the graph.

func (g *DAG) AddEdge(to, from *Vertex) error

AddEdge inserts an directed edge between two vertecies.

func (g *DAG) BFS(fn WalkFunc) error

BFS walks the graph in breadth-first order.

func (g *DAG) DFS(fn WalkFunc) error

DFS walks the graph in depth-first order.

func (g *DAG) Edges(v *Vertex) []*Vertex

Edges returns the outgoing edges for v.

func (g *DAG) Get(v interface{}) (*Vertex, bool)

Get returns the vertex for the corresponding value.

func (g *DAG) ReverseDFS(fn WalkFunc) error

ReverseDFS walks the graph in reverse depth-first order.

type Vertex struct {
	Value interface{}
}

Vertex is a vertex for DAG.

type WalkFunc func(*Vertex) error

WalkFunc is a common func for all graph walking methods.