Return the distance from vertex u to v. */
| 277 | |
| 278 | /** Return the distance from vertex u to v. */ |
| 279 | static int getDistance(const Graph& g, |
| 280 | vertex_descriptor u, vertex_descriptor v) |
| 281 | { |
| 282 | typedef graph_traits<Graph>::edge_descriptor edge_descriptor; |
| 283 | pair<edge_descriptor, bool> e = edge(u, v, g); |
| 284 | assert(e.second); |
| 285 | return g[e.first].distance; |
| 286 | } |
| 287 | |
| 288 | /** Return the length of the specified path in k-mer. */ |
| 289 | static unsigned calculatePathLength(const Graph& g, |
no test coverage detected