prim

Documentation

Overview

Package prim implements Prim's Minimum Spanning Tree algorithm.

Index

• func MST(g *gsd.Graph) (string, float64)
• func ShowMST(g *gsd.Graph, outputfile string)
• type VertexSlice
  • func (vs VertexSlice) Contains(vtx *gsd.Vertex) bool
  • func (vs VertexSlice) Len() int
  • func (vs VertexSlice) Less(i, j int) bool
  • func (vs *VertexSlice) Pop() interface{}
  • func (vs *VertexSlice) Push(x interface{})
  • func (vs VertexSlice) Swap(i, j int)

Functions

func MST

func MST(g *gsd.Graph) (string, float64)

MST implements Prim's Minimum Spanning Tree algorithm. It returns the Minimum Spanning Tree in DOT file format and the total weights of Minimum Spanning Tree.

func ShowMST

func ShowMST(g *gsd.Graph, outputfile string)

ShowMST shows the Minimum Spanning Tree.

Types

type VertexSlice

type VertexSlice []*gsd.Vertex

Min-Heap's first element is the minimum

func (VertexSlice) Contains

func (vs VertexSlice) Contains(vtx *gsd.Vertex) bool

Contains returns true if vtx exists in the VertexSlice.

func (VertexSlice) Len

func (vs VertexSlice) Len() int

func (VertexSlice) Less

func (vs VertexSlice) Less(i, j int) bool

func (*VertexSlice) Pop

func (vs *VertexSlice) Pop() interface{}

func (*VertexSlice) Push

func (vs *VertexSlice) Push(x interface{})

func (VertexSlice) Swap

func (vs VertexSlice) Swap(i, j int)