API Reference giraffe v0.1.3

Modules

Documentation for Giraffe.

Implementation of the Bellman-Ford algorithm for finding shortest paths in graphs.

Implementation of the Bron-Kerbosch algorithm for finding maximal cliques in graphs.

Public interface for working with graphs. Delegates to specific implementations based on whether the graph is directed or undirected.

Implementation of a directed graph with weighted edges. Vertices can be any term, and edges have numeric weights.

Implementation of an undirected graph with weighted edges. Vertices can be any term, and edges have numeric weights.

A Priority Queue implementation using a list-based heap structure. Lower priority values are dequeued first.