Skip to content

Weighted Bridging Centrality 1.0.1: release the graph lock when cancelled #364

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
mbastian merged 1 commit into from
Nov 8, 2026
Merged

Weighted Bridging Centrality 1.0.1: release the graph lock when cancelled #364

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
2 changes: 1 addition & 1 deletion modules/WeightedBridgingCentrality/pom.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@

<groupId>com.nathansteinmeyer</groupId>
<artifactId>weighted-bridging-centrality</artifactId>
<version>1.0.0</version>
<version>1.0.1</version>
<packaging>nbm</packaging>

<name>Weighted Bridging Centrality</name>
Expand Down
5 changes: 4 additions & 1 deletion ...ava/com/nathansteinmeyer/weightedbridgingcentrality/WeightedBridgingCentralityMetric.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -193,7 +193,8 @@ private double[] calculateBetweeness(Graph graph, HashMap<Node, Integer> indicie

Progress.start(progressTicket, Number_of_Nodes);
//Weighted shortest-path search to calculate all shortest paths from node s to t
for (Node s : graph.getNodes()) {
NodeIterable nodeIterable = graph.getNodes();
for (Node s : nodeIterable) {
//The below structures are candidates to performance improvments:
//Creates a stack for each node, ...
Stack<Node> S = new Stack<Node>();
Expand Down Expand Up @@ -298,6 +299,8 @@ private double[] calculateBetweeness(Graph graph, HashMap<Node, Integer> indicie
count++;

if (cancelled) {
// Leaving the loop early keeps the graph read-locked unless the iterable is told
nodeIterable.doBreak();
return nodeBetweenness;
}

Expand Down
Loading