Edge represents an edge that joins two vertices. Even though these edges are always referred to as source and target, whether the graph is directed or

EdgeProperties represents a set of properties that each edge possesses. They can be set when adding a new edge using the corresponding functional opti

Graph represents a generic graph data structure consisting of vertices of type T identified by a hash of type K.

Hash is a hashing function that takes a vertex of type T and returns a hash value of type K. Every graph has a hashing function and uses that functio

Store represents a storage for vertices and edges. The graph library provides an in-memory store by default and accepts any Store implementation to wo

Traits represents a set of graph traits and types, such as directedness or acyclicness. These traits can be set when creating a graph by passing the c

VertexProperties represents a set of properties that each vertex has. They can be set when adding a vertex using the corresponding functional options:

minHeap is a minimum binary heap that implements heap.Interface.

priorityItem is an item on the binary heap consisting of a priority value and an actual payload value.

priorityQueue implements a minimum priority queue using a minimum binary heap that prioritizes smaller values over larger values.

unionFind implements a union-find or disjoint set data structure that works with vertex hashes as vertices. It's an internal helper type at the moment