graph

Documentation

Index

• func NewVertexSet(size int) *vertexSet
• type Edge
  • func (e *Edge) String() string
• type Finder
  • func NewDFSLoopFinder() Finder
  • func NewDFSRecursiveFinder() Finder
• type Graph
  • func New() *Graph
  • func (g *Graph) AddEdge(start *Vertex, end *Vertex)
  • func (g *Graph) Dump() string
  • func (g *Graph) Edges(v *Vertex) []*Edge
  • func (g *Graph) Vertices() []*Vertex
• type Vertex
  • func NewVertex(v string) *Vertex
  • func (v *Vertex) IsEqual(other *Vertex) bool
  • func (v *Vertex) String() string
• type Visitor
  • func NewListVisitor() Visitor

Functions

func NewVertexSet

func NewVertexSet(size int) *vertexSet

Types

type Edge

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

func (*Edge) String

func (e *Edge) String() string

type Finder

type Finder interface {
	Find(g *Graph, start *Vertex, target *Vertex, visitor Visitor) bool
}

func NewDFSLoopFinder

func NewDFSLoopFinder() Finder

func NewDFSRecursiveFinder

func NewDFSRecursiveFinder() Finder

type Graph

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

func New

func New() *Graph

func (*Graph) AddEdge

func (g *Graph) AddEdge(start *Vertex, end *Vertex)

func (*Graph) Dump

func (g *Graph) Dump() string

func (*Graph) Edges

func (g *Graph) Edges(v *Vertex) []*Edge

func (*Graph) Vertices

func (g *Graph) Vertices() []*Vertex

type Vertex

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

func NewVertex

func NewVertex(v string) *Vertex

func (*Vertex) IsEqual

func (v *Vertex) IsEqual(other *Vertex) bool

func (*Vertex) String

func (v *Vertex) String() string

type Visitor

type Visitor interface {
	Visit(g *Graph, v *Vertex)
}

func NewListVisitor

func NewListVisitor() Visitor