graph

package

v0.2.5-alpha Latest Latest Go to latest Published: Jan 24, 2023 License: GPL-3.0 Imports: 2 Imported by: 0

Details

This section is empty.

View Source

var ErrorNotFoundVertex = errors.New("Not found vertex")

This section is empty.

type EdgeInfo[Label comparable] struct {
	VertexFrom Label
	VertexTo   Label
}

type Graph[T any, Label comparable] struct {
	// contains filtered or unexported fields
}

func NewGraph[T any, Label comparable](vertexes []VertexInfo[T, Label]) *Graph[T, Label]

func (graph *Graph[T, Label]) AddOrientedEdge(vertexFrom, vertexTo Label) error

func (graph *Graph[T, Label]) AddOrientedEdges(edges ...EdgeInfo[Label]) (err error)

func (graph *Graph[T, Label]) AddUndirectedEdge(vertexFirst, vertexSecond Label) error

func (graph *Graph[T, Label]) AddUndirectedEdges(edges ...EdgeInfo[Label]) (err error)

func (graph *Graph[T, Label]) AddVertex(label Label, value T)

func (graph *Graph[T, Label]) BFS(startVertex Label, visitor Visitor[T])

func (graph *Graph[T, Label]) DFS(startVertex Label, visitor Visitor[T])

func (graph *Graph[T, Label]) DeleteOrientedEdge(vertexFrom, vertexTo Label) error

func (graph *Graph[T, Label]) DeleteUndirectedEdge(vertexFirst, vertexSecond Label) error

func (graph *Graph[T, Label]) DeleteVertex(label Label)

func (graph *Graph[T, Label]) SetVertexes(vertexes []VertexInfo[T, Label])

type Node[T any, Label comparable] struct {
	ValueNode[T]
	// contains filtered or unexported fields
}

type ValueNode[T any] struct {
	Value T
}

type VertexInfo[T any, Label comparable] struct {
	Label Label
	Value T
}

type Visitor[T any] func(value *ValueNode[T]) (stop bool)