dfs_cycle

package

v0.0.0-...-8859e38 Latest Latest Go to latest Published: Dec 31, 2018 License: MIT Imports: 1 Imported by: 0

Details

dfs_cycle finds a simple cycle in an undirected graph

This section is empty.

This section is empty.

This section is empty.

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

func (b *Bag) Add(i int)

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

Cycle holds information about a possibly existing simple cycle

func NewDFSCyle(g *graph.Graph) *Cycle

func (c *Cycle) Cycle() []int

func (c *Cycle) HasCycle() bool

func (c *Cycle) HasParallelEdges(g *graph.Graph) bool

func (c *Cycle) HasSelfLoop(g *graph.Graph) bool