container

type AdjacencyMap map[uint64]cardinality.Duplex[uint64]

type DirectedGraph interface {
	AddEdge(start, end graph.ID)
	NumNodes() uint64
	Nodes() cardinality.Duplex[uint64]
	Degrees(node uint64, direction graph.Direction) uint64
	Adjacent(node uint64, direction graph.Direction) []uint64
	EachNode(delegate func(node uint64) bool)
	EachAdjacent(node uint64, direction graph.Direction, delegate func(adjacent uint64) bool)
	BFSTree(nodeID uint64, direction graph.Direction) []ShortestPathTerminal
	Normalize() ([]uint64, DirectedGraph)
	Dimensions(direction graph.Direction) (uint64, uint64)
}

type EFSet struct {
	// contains filtered or unexported fields
}

type EFSetIterator struct {
	// contains filtered or unexported fields
}

type PackedMap struct {
	// contains filtered or unexported fields
}

type Parameters struct {
	BucketKeyStride uint64
	NumMaxEntries   int
	NumBuckets      int
}

type ShortestPathTerminal struct {
	NodeID   uint64
	Distance Weight
}

type Weight = float64