Crate libmatchtigs

source ·
Expand description

A library containing the matchtigs algorithms. Use this to compute pathtigs (similar to simplitigs and UST-tigs), greedy matchtigs and matchtigs for arbitrary graph types.


  • Bindings of our algorithms for the C language. These allow to pass the graph topology as a list of edges from a node-centric de Bruijn graph. There is only one global graph that can be controlled via the bindings, no two graphs can be created at the same time.



  • The heap data structure used by Dijkstra’s algorithm.
  • The type of the data structure to store the weight of visited nodes in Dijkstra’s algorithm.


  • The edge data of the graph to compute matchtigs on has to implement this.
  • An algorithm to compute tigs for a graph.