sausheong

import "golang.org/x/exp/constraints"

type Number interface {
    constraints.Integer | constraints.Float
}

func AddNumbers[T Number](a, b T) T {
    return a + b
}

sausheong

func Add[T int | float64](a, b T) T {
	return a + b
}

sausheong

type Integer struct {
	...
}

func (i Integer) Plus(a Number) Number {
	...
}

sausheong

type Number interface {
	Plus(Number) Number
}

func Add(a, b Number) Number {
	return a.Plus(b)
}

sausheong

func AddInt(a, b int) int {
	return a + b
}

func AddFloat(a, b float64) float64 {
	return a + b
}

sausheong

unc main() {
	graph := buildGraph()
	fmt.Println("GRAPH\n-----")
	nodes := sortNodes(graph.Nodes)
	for _, node := range nodes {
		fmt.Printf("%s -> %v\n", node.name, graph.Edges[node.name])
	}

	fmt.Println()
	bMST := boruvka(graph)

sausheong

package main

import (
	"testing"
)
func BenchmarkBoruvka(b *testing.B) {
	graph := buildGraph()
	b.ResetTimer()
	for i := 0; i < b.N; i++ {
		boruvka(graph)

sausheong

func main() {
	graph := buildGraph()
	fmt.Println("GRAPH\n-----")
	nodes := sortNodes(graph.Nodes)
	for _, node := range nodes {
		fmt.Printf("%s -> %v\n", node.name, graph.Edges[node.name])
	}

	fmt.Println()
	bMST := boruvka(graph)

sausheong

func (g *Graph) HasNode(name string) (yes bool) {
	for _, n := range g.Nodes {
		if n.name == name {
			yes = true
		}
	}
	return
}

sausheong

func prim(graph *Graph, nodeName string) (mst *Graph) {
	mst = NewGraph()
	h := &Heap{}
	heap.Init(h)

	startNode := graph.GetNode(nodeName)
	mst.AddNode(startNode)
	for _, edge := range graph.Edges[startNode.name] {
		heap.Push(h, NodePair{startNode, edge})
	}