galantelab / sideRETRO / #234

Builds Branch Commit Type Ran Committer Via Coverage
#234 HEAD Version 1.1.0 push Thiago L. A. Miller travis-ci pending completion   set done
#233 master Version 1.1.0 push Thiago L. A. Miller travis-ci pending completion   set done
#232 dev ADD: .github/workflows/ci_meson.yml push Thiago L. A. Miller travis-ci pending completion   set done
373 assembly ADD: graph_enumerate.c: Find bubble motifs Find bubble motifs in unipath graphs push thiago-miller travis-ci pending completion   set done
371 assembly CHANGE: graph_unipath.c: Alias Graph to Unipath push thiago-miller travis-ci pending completion   set done
370 assembly UPDATE: graph_unipath.c: Add start and end nodes push thiago-miller travis-ci pending completion   set done
369 assembly ADD: assembly/sucateiro.c (printers): Dump graph Print the k-mers, edges depths and dot file push thiago-miller travis-ci pending completion   set done
368 assembly ADD: assembly/sucateiro.c: Assembler for testing push thiago-miller travis-ci pending completion   set done
367 assembly ADD: graph_unipath.c: Build an unipath graph Path contraction is a techinque, which may help out to enumerate some motifs, as tips, bubbles and super bubbles push thiago-miller travis-ci pending completion   set done
366 assembly CHANGE: graph.c: Parent list in adjacency In order to quickly find all parents to a given vertex and also find the vertex in out degrees, it keeps a parent list in each adjacency push thiago-miller travis-ci pending completion   set done
365 assembly CHANGE: graph.c, debrujin.c (graph_ins_edge) Keep an exclusive pointer to vertex edges, that way, it is possible to manipulate different edge attributes for the same vertex push thiago-miller travis-ci pending completion   set done
364 assembly ADD: debrujin.c (debrujin_shortest_path): BFS Solve unweighted shortest path with 'Breadth First Search'. Floyd Warshall algorithm takes so much time and space push thiago-miller travis-ci pending completion   set done
363 assembly ADD: hungarian.c: Solve Minimum Assignment Problem Solving the minimum mssignment problem using the hungarian method. Code adapted from 'libhungarian' by Cyrill Stachniss, 2004. Make the cost matrix work with double push thiago-miller travis-ci pending completion   set done
362 assembly ADD: floyd_warshall.c (floyd_warshall_path): Path Return a list of nodes from vertex a to vertex b - it is the shortest path between them push thiago-miller travis-ci pending completion   set done
361 assembly ADD: floyd_warshall.c (floyd_warshall_dist): Look Search for the distance between vertices push thiago-miller travis-ci pending completion   set done