Ali Ghaffaari
Ali Ghaffaari
The text and its index of the set of maximal paths can be dumped to the file and be re-used in later runs. Apart from that, the list of nodes...
For some graph iterators, e.g. BFS iterator, reallocating all required memory over on each traversal slows down the process when the graph should be traversed multiple times. Adding an interface...
The nodes with zero out-degree are not traversed.
It is assumed that the genome graph is DAG when I have been developing so far. However, not all genome graphs are DAG, e.g. overlap graphs. The code needs to...
The code style is not consistent throughout the project. Most notable inconsistencies are: - variable names and naming convention - in some cases, type should be manifest (avoid using `auto`...
Python 3.5 is going to retire soon (Sep. 2020). **Todo:** - [ ] Warn users who are still using Python3.5 about dropping support in advance (deprecation warning). - [ ]...
The [definition of `write_int` function](https://github.com/simongog/sdsl-lite/blob/c32874cb2d8524119f25f3b501526fe692df29f4/include/sdsl/bits.hpp#L456C7-L456C7) differs from its [declaration](https://github.com/simongog/sdsl-lite/blob/c32874cb2d8524119f25f3b501526fe692df29f4/include/sdsl/bits.hpp#L201) in `bits` struct: ```c++ static void write_int(uint64_t* word, uint64_t x, const uint8_t offset=0, const uint8_t len=64); ... inline void bits::write_int(uint64_t* word,...
I have been using `xg` as a succinct graph data structure since it was a standalone library. When it was merged to `vg`, I had to move on to `libvg`....