| 8 | */ |
| 9 | template <typename Graph> |
| 10 | size_t markNeighbours(Graph* g, |
| 11 | const typename Graph::value_type& u, extDirection sense) |
| 12 | { |
| 13 | typedef typename graph_traits<Graph>::vertex_descriptor V; |
| 14 | typedef typename std::vector<V> Vector; |
| 15 | |
| 16 | Vector adj; |
| 17 | generateSequencesFromExtension(u.first, sense, |
| 18 | u.second.getExtension(sense), adj); |
| 19 | for (typename Vector::iterator v = adj.begin(); v != adj.end(); ++v) |
| 20 | g->mark(*v, !sense); |
| 21 | return adj.size(); |
| 22 | } |
| 23 | |
| 24 | /** Mark ambiguous branches and branches from palindromes for removal. |
| 25 | * @return the number of branches marked |
no test coverage detected