Skip to content

Commit 6a2d2c0

Browse files
🚚 refactor: Rename kahn to kahn1962.
1 parent 6ba2fa6 commit 6a2d2c0

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

src/kahn.js renamed to src/kahn1962.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@
77
* @param {any} graph
88
* @returns {Iterable<any>} The vertices in topological order.
99
*/
10-
export default function* kahn(queue, graph) {
10+
export default function* kahn1962(queue, graph) {
1111
while (true) {
1212
const u = queue.pop();
1313
if (u === undefined) break;

src/sorted.js

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
import Heap from '@aureooms/js-pairing-heap';
22
import {EfficientlyInvertiblePairs as Pairs} from '@aureooms/js-pairs';
33

4-
import kahn from './kahn.js';
4+
import kahn1962 from './kahn1962.js';
55

66
/**
77
* Sort the vertices topologically breaking ties according to a given function.
@@ -19,5 +19,5 @@ export default function sorted(edges, breakTies = undefined) {
1919
for (const [, v] of graph) freeVertices.delete(v);
2020
for (const u of freeVertices) queue.push(u);
2121

22-
return kahn(queue, graph);
22+
return kahn1962(queue, graph);
2323
}

0 commit comments

Comments
 (0)