File tree Expand file tree Collapse file tree
matsim/src/main/java/org/matsim/core/router/speedy Expand file tree Collapse file tree Original file line number Diff line number Diff line change 4848 * <li><b>FM refinement</b>: Fiduccia–Mattheyses local search minimises
4949 * the edge cut of the underlying bipartition, using a bucket linked-list
5050 * for O(1) max-gain lookup. Up to 5 passes until fixpoint.</li>
51- * <li><b>Max-flow refinement</b>: Dinic&apos ;s algorithm on a node-split flow
51+ * <li><b>Max-flow refinement</b>: Dinic&rsquo ;s algorithm on a node-split flow
5252 * network finds the minimum vertex separator between the two partition
5353 * sides. Each internal node is split into v_in/v_out with capacity 1;
5454 * original edges have capacity ∞.</li>
@@ -1571,6 +1571,8 @@ private void buildSymmetricAdjacency() {
15711571
15721572 int [] degree = new int [n ];
15731573 SpeedyGraph .LinkIterator outLI = graph .getOutLinkIterator ();
1574+ // getToNodeIndex() always returns a valid index in [0, nodeCount) because
1575+ // SpeedyGraph only stores links whose endpoints are registered nodes.
15741576 for (int node = 0 ; node < n ; node ++) {
15751577 outLI .reset (node );
15761578 while (outLI .next ()) {
You can’t perform that action at this time.
0 commit comments