christoph/cpp-masssprings
1
Fork 0
Code Releases Activity

implement automatic graph traversal along shortest path to solution

Browse Source
This commit is contained in:
Christoph Urlacher
2026-02-25 02:58:30 +01:00
parent fd58f217c6
commit 271902ab1f
7 changed files with 62 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
src/distance.cpp
View File

@ -56,17 +56,12 @@ auto CalculateDistances(
queue.pop();
for (std::size_t neighbor : adjacency[current]) {
// std::cout << "Visiting edge (" << current << "->" << neighbor << ")."
// << std::endl;
if (distances[neighbor] == -1) {
// If distance is -1 we haven't visited the node yet
distances[neighbor] = distances[current] + 1;
parents[neighbor] = current;
nearest_targets[neighbor] = nearest_targets[current];
// std::cout << "- Distance: " << distances[neighbor]
// << ", Parent: " << parents[neighbor]
// << ", Nearest Target: " << nearest_targets[neighbor] << "."
// << std::endl;
queue.push(neighbor);
}
}