gograph

type Connections[K comparable, W comparable, V any] map[K]WeightedEdge[W, V]

type Graph[K comparable, V any] struct {
	IsBidirectional      bool                            `json:"IsBidrectional"`
	Vertices             map[K]Connections[K, uint64, V] `json:"Vertices"`
	VertexCount          int                             `json:"VertexCount"`
	EdgeCount            int                             `json:"EdgeCount"`
	AllPairShortestPaths map[Tuple2[K]]Route[K, V]       `json:"AllPairShortestPath"`
}

type Route[K comparable, V any] struct {
	Vertices []K
	Edges    []WeightedEdge[uint64, V]
	Distance uint64
}

type Tuple2[K comparable] struct {
	One K
	Two K
}

type WeightedEdge[W comparable, V any] struct {
	Weight   W
	Metadata V
}