shortest_cycle.hpp File Reference

#include <unordered_map>
#include "../handle.hpp"
#include "eades_algorithm.hpp"
#include "structures/rank_pairing_heap.hpp"

Namespaces
	vg
	vg::algorithms

Functions
size_t	vg::algorithms::shortest_cycle_length (const HandleGraph *graph)
size_t	vg::algorithms::shortest_cycle_length (const HandleGraph *graph, const handle_t &source)