removes all edges (source,target)
| 340 | |
| 341 | // removes all edges (source,target) |
| 342 | int32_t DeleteEdgesTo(const NodeIterator source, const NodeIterator target) |
| 343 | { |
| 344 | int32_t deleted = 0; |
| 345 | for (EdgeIterator i = BeginEdges(source), iend = EndEdges(source); i < iend - deleted; ++i) |
| 346 | { |
| 347 | if (edge_list[i].target == target) |
| 348 | { |
| 349 | do |
| 350 | { |
| 351 | deleted++; |
| 352 | edge_list[i] = edge_list[iend - deleted]; |
| 353 | makeDummy(iend - deleted); |
| 354 | } while (i < iend - deleted && edge_list[i].target == target); |
| 355 | } |
| 356 | } |
| 357 | |
| 358 | number_of_edges -= deleted; |
| 359 | node_array[source].edges -= deleted; |
| 360 | |
| 361 | return deleted; |
| 362 | } |
| 363 | |
| 364 | // searches for a specific edge |
| 365 | EdgeIterator FindEdge(const NodeIterator from, const NodeIterator to) const |