Skip to content

Releases: vc-souza/gga

v 0.1.1

25 Jul 04:03
61041e0

Choose a tag to compare

  • Removing ineffective assignment

v 0.1.0

25 Jul 01:59
ec967ec

Choose a tag to compare

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

v 0.0.11

22 Jul 04:39
7533058

Choose a tag to compare

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

v 0.0.10

19 Jul 05:20
a410fa9

Choose a tag to compare

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

v 0.0.9

17 Jul 21:06
2e5a80a

Choose a tag to compare

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

v 0.0.8

16 Jul 05:35
3c48da4

Choose a tag to compare

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

v 0.0.7

15 Jul 16:42
9d80482

Choose a tag to compare

  • 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

14 Jul 04:49
f22ef25

Choose a tag to compare

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

v 0.0.5

12 Jul 20:13
c06058b

Choose a tag to compare

  • 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

12 Jul 01:01
ef4b8f0

Choose a tag to compare

  • BFS implementation
  • BFS visualization support
  • BFS visualization sample