Method Len

graph/prim.go:14–14

()

type minEdge []Edge

func (h minEdge) Len() int           { return len(h) }
func (h minEdge) Less(i, j int) bool { return h[i].Weight < h[j].Weight }
func (h minEdge) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }