0.3.1 - Small Improvements

• Implement Eulerian cycle
• Implement bidirected Eulerian cycle
• Implement an actually compact genome representation
• Implement more different file formats for genome graphs
• Improve walks and sequences
• Implement node centric trivial omnitigs
• Implement efficient Dijkstra
• Add more experiments

0.2.0 - Compute Omnitigs

Implemented algorithms to compute omnitigs, together with many minor features like I/O to/from the wtdbg2 assembler and some abstractions.

0.1.0 - Hello World

Print simple statistics about graphs generated from bcalm.