vg
tools for working with variation graphs
Loading...
Searching...
No Matches
Namespaces | Functions
graph.cpp File Reference
#include "graph.hpp"

Namespaces

namespace  vg
 

Functions

void vg::sort_by_id_dedup_and_clean (Graph &graph)
 remove duplicates and sort by id
 
void vg::remove_duplicates (Graph &graph)
 remove duplicate nodes and edges
 
void vg::remove_duplicate_edges (Graph &graph)
 remove duplicate edges
 
void vg::remove_duplicate_nodes (Graph &graph)
 remove duplicate nodes
 
void vg::remove_orphan_edges (Graph &graph)
 remove edges that link to a node that is not in the graph
 
void vg::sort_by_id (Graph &graph)
 order the nodes and edges in the graph by id
 
void vg::sort_nodes_by_id (Graph &graph)
 order the nodes in the graph by id
 
void vg::sort_edges_by_id (Graph &graph)
 order the edges in the graph by id pairs
 
bool vg::is_id_sortable (const Graph &graph)
 returns true if the graph is id-sortable (no reverse links)
 
bool vg::has_inversion (const Graph &graph)
 returns true if we find an edge that may specify an inversion
 
void vg::flip_doubly_reversed_edges (Graph &graph)
 clean up doubly-reversed edges
 
void vg::from_handle_graph (const HandleGraph &from, Graph &to)
 
void vg::from_path_handle_graph (const PathHandleGraph &from, Graph &to)