Print a distance map. */
| 443 | |
| 444 | /** Print a distance map. */ |
| 445 | static void printDistanceMap(ostream& out, const Graph& g, |
| 446 | const ContigNode& u, const ContigPath& path) |
| 447 | { |
| 448 | typedef map<ContigNode, int> DistanceMap; |
| 449 | DistanceMap distanceMap = makeDistanceMap(g, u, path); |
| 450 | for (DistanceMap::const_iterator it = distanceMap.begin(); |
| 451 | it != distanceMap.end(); ++it) |
| 452 | out << get(edge_name, g, make_pair(u, it->first)) |
| 453 | << " [d=" << it->second << "]\n"; |
| 454 | } |
| 455 | |
| 456 | typedef std::vector<std::pair<ContigNode, DistanceEst> > Estimates; |
| 457 |
no test coverage detected