#include <vector>
#include <algorithm>
#include <cmath>
#include <list>
#include <valarray>

#include <network.hpp>


template<class T>
bool is_shorter(const std::list<T> &, const std::list<T> &);

//bool trivial(boost::detail::edge_desc_impl<boost::undirected_tag,unsigned long>);

//std::list<std::pair<std::array<unsigned, 2>, std::list<unsigned>>> find_minimal_crack(const Graph &, const network &);