v 0.1.1

• Removing ineffective assignment

v 0.1.0

• Reworked how graphs are represented.
• Removed most uses of generics, only kept the essential ones.
• Performance improvements

v 0.0.11

• Implementation for MST Prim and MST Kruskal
• Improved assertion functions
• Benchmark for MST
• Reworked error vars

v 0.0.10

• Disjoint-Set implementation (Forest)
• SCC algo benchmark (Kosaraju vs Tarjan)
• CC algos for undirected graphs:
  • DFS
  • Union-Find

v 0.0.9

Added an algorithm to calculate a condensation graph, based on the results of Tarjan's SCC algorithm.

v 0.0.8

• Added Tarjan's and Kosaraju's, both algorithms to find all strongly connected components in a directed graph.

v 0.0.7

• Added implementation, visualization and sample of an algorithm for Topological Sort
• Simplified BFS and DFS algorithms
• Reworked Viz types, added interface
• Now using embed module to embed textual graph examples
• Added support for themes

v 0.0.6

• Implementation of the DFS algorithm.
• Nicer samples for both BFS and DFS.

v 0.0.5

• Added support for parsing a graph from text if the underlying type is going to be a string anyway.
• Started using test fixtures + text parsing for tests that are unrelated to how graphs are built (like those for algo and viz).
• Modified the DOT exporter so that it makes the 'Graph.Accept' call itself before exporting.

v 0.0.4

• BFS implementation
• BFS visualization support
• BFS visualization sample