Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LazyPrimeMST ¶
type LazyPrimeMST struct {
// contains filtered or unexported fields
}
LazyPrimeMST is a data type for computing the minimum spanning tree/forest in an edge weighted undirected graph using a lazy version of Prim’s algorithm with a binary heap
func NewLazyPrimeMST ¶
func NewLazyPrimeMST(g *edge_weighted_graph.EdgeWeightedGraph) *LazyPrimeMST
func (*LazyPrimeMST) Edges ¶
func (mst *LazyPrimeMST) Edges() []edge.Edge
func (*LazyPrimeMST) Weight ¶
func (mst *LazyPrimeMST) Weight() float64
Source Files
Click to show internal directories.
Click to hide internal directories.