libgraph v0.5.0 API Reference

Modules

This module defines a directed graph data structure, which supports both acyclic and cyclic forms. It also defines the API for creating, manipulating, and querying that structure

This module defines the struct used to represent edges and associated metadata about them

This module contains implementation code for path finding algorithms used by libgraph

This module defines the Serializer behavior for graphs

This serializer converts a Graph to a DOT file, which can then be converted to a great many other formats using Graphviz, e.g. dot -Tpng out.dot > out.png

This module defines a priority queue datastructure, which uses a min heap structure to support pulling the values with the lowest priority out first. This is optimized for use with graph search algorithms where the smallest in/out degree or lowest edge weight/cost should be evaluated before those with higher values. Values with the same priority are dequeued in the order they were originally queued