Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

gl
algorithm
BFS	Class that provides Graph traversal using the BFS scheme
Dijkstra	Class that computes Dijkstra's Shortest Paths algorithm
FloydWarshall	Class computes that Shortest Paths for all pairs of nodes in the graph using the Floyd-Warshall algorithm
Kruskal	Class that computes a Minimum Spanning Tree using Kruskal's algorithm
interface
io
YAMLReader	Class to Read from a YAML file
external
Color	Stores an RGBA Color
DisjointSets	Represents disjoint sets
Distance	Implements a numerical distance that supports "infinite distance"
Edge	Represents an Edge in a Graph
Graph	Stores and implements a Graph
Edge_Iterator	Edge_Iterator class. Used to iterate over all Edges in the Graph
Node	Represents a Node in a Graph
Property	Stores the properties of a Graph