func (l WeightedEdgeList) Less(i, j int) bool {
	return l.WeightFunc(l.Edges[i].LI) < l.WeightFunc(l.Edges[j].LI)
}
Less implements sort.Interface.
package graph
type NI int32
type NodeList []NI
func (l NodeList) Len() int           { return len(l) }
func (l NodeList) Less(i, j int) bool { return l[i] < l[j] }
func (l NodeList) Swap(i, j int)      { l[i], l[j] = l[j], l[i] }
type AdjacencyList [][]NI
type Directed struct {
	AdjacencyList  
}
type Undirected struct {
	AdjacencyList  
}
type LI int32
type Half struct {
	To    NI  
	Label LI  
}
type LabeledAdjacencyList [][]Half
type LabeledDirected struct {
	LabeledAdjacencyList  
}
type LabeledUndirected struct {
	LabeledAdjacencyList  
}
type Edge struct{ N1, N2 NI }
type LabeledEdge struct {
	Edge
	LI
}
type WeightFunc func(label LI) (weight float64)
type WeightedEdgeList struct {
	Order int
	WeightFunc
	Edges []LabeledEdge
}
func (l WeightedEdgeList) Len() int { return len(l.Edges) }