kruskal_mst

type KruskalMST ¶

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

KruskalMST is a data type that computes the minimum spanning tree of an undirected edge weighted graph. The implementation uses Kruskal's algorithm, a minimum priority queue and the union find data type.

func NewKruskalMST(g *edge_weighted_graph.EdgeWeightedGraph) *KruskalMST

func (mst *KruskalMST) Edges() Queue

func (mst *KruskalMST) Weight() float64

type Node ¶

type Node struct {
	Item edge.Edge
	Next *Node
}

func NewNode(e edge.Edge) *Node

type Queue ¶

type Queue struct {
	First *Node
	Last  *Node
	Size  int
}

func NewEmptyQueue() Queue

func (q *Queue) IsEmpty() bool

func (q *Queue) Peek() (edge.Edge, error)

func (q *Queue) Pop() (edge.Edge, error)

func (q *Queue) Push(e edge.Edge)