Also check if the new path intersects for path_b

master
Markus Koch 2021-06-20 14:46:07 +02:00
parent 7753ce8477
commit ff214722a8
1 changed files with 2 additions and 0 deletions

View File

@ -393,6 +393,8 @@ int dijkstra_path_intersect(struct dijkstra_solver *solver,
path_new->weight = dijkstra_get_weight_from_distance(path_new->source,
path_new->destination,
path_new->net_meta->type);
dijkstra_path_intersect_all(solver, path_a, path_new);
}
// In case neither if matches that means we are on the corner where two paths intersect at their ends.