| 153 | } stats; |
| 154 | |
| 155 | struct AmbPathConstraint { |
| 156 | ContigNode source; |
| 157 | ContigNode dest; |
| 158 | int dist; |
| 159 | |
| 160 | AmbPathConstraint(const ContigNode& src, const ContigNode& dst, |
| 161 | int d) |
| 162 | : source(src), dest(dst), dist(d) {} |
| 163 | |
| 164 | bool operator ==(const AmbPathConstraint& a) const |
| 165 | { |
| 166 | return source == a.source && dest == a.dest |
| 167 | && dist == a.dist; |
| 168 | } |
| 169 | |
| 170 | bool operator <(const AmbPathConstraint& a) const |
| 171 | { |
| 172 | return source < a.source |
| 173 | || (source == a.source && dest < a.dest) |
| 174 | || (source == a.source && dest == a.dest |
| 175 | && dist < a.dist); |
| 176 | } |
| 177 | }; |
| 178 | |
| 179 | typedef ContigGraph<DirectedGraph<ContigProperties, Distance> > Graph; |
| 180 | typedef ContigPath Path; |