Function omnitigs::unitigs::uncompacted_unitigs::count_uncompacted_node_unitigs

source · 
pub fn count_uncompacted_node_unitigs<Graph: StaticGraph>(
    graph: &Graph
) -> UncompactedNodeUnitigs
Expand description

Returns the amount of node unitigs in the graph that can be compacted. A unitig can be compacted if

  • it contains more than one inner node, or
  • it contains one inner node and its first node has outdegree one, or
  • it contains one inner node and its last node has indegree one, or
  • it contains two nodes (no inner node) and its first node has outdegree one and its second node has indegree one.