graph

Documentation

Index

• Constants
• func NewGraph[K cmp.Ordered, T any](list ...*Node[K, T]) *graph[K, T]
• type Node
  • func NewNode[K cmp.Ordered, T any](key K, data T) *Node[K, T]
  • func (n *Node[K, T]) Data() T
  • func (n *Node[K, T]) Key() K
  • func (n *Node[K, T]) Next() *Node[K, T]
  • func (n *Node[K, T]) String() string

Constants

const (
	BFS traversalOrder = iota
	DFS
)

Functions

func NewGraph

func NewGraph[K cmp.Ordered, T any](list ...*Node[K, T]) *graph[K, T]

Types

type Node

type Node[K cmp.Ordered, T any] struct {
	// contains filtered or unexported fields
}

func NewNode

func NewNode[K cmp.Ordered, T any](key K, data T) *Node[K, T]

func (*Node[K, T]) Data

func (n *Node[K, T]) Data() T

func (*Node[K, T]) Key

func (n *Node[K, T]) Key() K

func (*Node[K, T]) Next

func (n *Node[K, T]) Next() *Node[K, T]

func (*Node[K, T]) String

func (n *Node[K, T]) String() string