graph

README

pkg graph

Inclusive Graph Package in Go. Requires Go 1.18+.

Installation

go get github.com/Qs-F/graph

Usage

Coming soon

License

MIT

Author

Qs-F

Documentation

Index

• type Node
  • func NewNode[T any](value T) *Node[T]
  • func (node *Node[T]) Add(children ...*Node[T])
  • func (node *Node[T]) BFS(f func(value T) bool)
  • func (node *Node[T]) DFS(f func(value T) bool)
• type Queue
  • func NewQueue[T any](values ...T) *Queue[T]
  • func (queue *Queue[T]) Len() int
  • func (queue *Queue[T]) Peek() T
  • func (queue *Queue[T]) Pop() T
  • func (queue *Queue[T]) Push(values ...T)

Types

type Node

type Node[T any] struct {
	Value    T
	Children []*Node[T]
}

func NewNode

func NewNode[T any](value T) *Node[T]

func (*Node[T]) Add

func (node *Node[T]) Add(children ...*Node[T])

func (*Node[T]) BFS

func (node *Node[T]) BFS(f func(value T) bool)

func (*Node[T]) DFS

func (node *Node[T]) DFS(f func(value T) bool)

type Queue

type Queue[T any] []T

func NewQueue

func NewQueue[T any](values ...T) *Queue[T]

func (*Queue[T]) Len

func (queue *Queue[T]) Len() int

func (*Queue[T]) Peek

func (queue *Queue[T]) Peek() T

func (*Queue[T]) Pop

func (queue *Queue[T]) Pop() T

func (*Queue[T]) Push

func (queue *Queue[T]) Push(values ...T)