graph

package

v0.0.0-...-b071cee Latest Latest Go to latest Published: Aug 9, 2023 License: GPL-3.0 Imports: 1 Imported by: 0

Details

This section is empty.

View Source

var (
	ErrInvalidNode = errors.New("非法节点")
	ErrInvalidEdge = errors.New("非法边")
)

This section is empty.

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

Graph is a directed graph represented by adjacency Matrix

func NewGraphByMatrix(matrix [][]int) *Graph

func NewRawGraph(nodeNum int) *Graph

func (g *Graph) AddEdge(n, m int, v int) error

AddEdge 添加一条从n指向m，权值为v的边

func (g *Graph) BFS(op func(n int))

BFS 广度优先搜索

func (g *Graph) DFS(op func(n int))

DFS 深度优先搜索

func (g *Graph) DelEdge(n, m int) error

DelEdge 删除从n指向m的边

func (g *Graph) HasEdge(n, m int) int

HasEdge 检查从n到m是否有边，若有返回边权值，否则返回0

func (g *Graph) Neighbors(n int) ([]int, error)

Neighbors 获取结点n的所有“邻居”，即一步内可到达n或n可到达的结点