Skip to content

Optimize midpoint computation in island detection BFS #102

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yamilbknsu merged 2 commits into from
Feb 11, 2026
Merged

Optimize midpoint computation in island detection BFS #102

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
a6b6b3b
Initial plan
Copilot Feb 11, 2026
d26d76c
Optimize: compute start edge midpoint once per component
Copilot Feb 11, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion rust/bambam-omf/src/graph/component_algorithm.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,6 +76,7 @@ pub fn island_detection_algorithm(
queue.push_back((start_edge.edge_list_id, start_edge.edge_id));
let mut max_distance_reached = uom_length::new::<uom::si::length::meter>(0 as f64);
let mut component = Vec::<(EdgeListId, EdgeId)>::new();
let start_midpoint = compute_midpoint(start_edge, vertices);

// Loop through the queue (explore the component)
loop {
Expand All @@ -88,7 +89,7 @@ pub fn island_detection_algorithm(

let current_distance = is_component_island_sequential(
&current_edge,
compute_midpoint(start_edge, vertices),
start_midpoint,
&mut visited,
&mut queue,
vertices,
Expand Down
Loading