#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/range/combine.hpp>
#include <boost/foreach.hpp>

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

#include <network.hpp>

struct EdgeProperties {
  unsigned index;
};

typedef boost::adjacency_list<boost::listS, boost::vecS, boost::undirectedS, boost::no_property, EdgeProperties> Graph;


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<unsigned> find_minimal_crack(const Graph &, const network &);