Skip to content
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

Update feasible-tree-test.js #362

Merged
merged 1 commit into from
Sep 11, 2023
Merged

Update feasible-tree-test.js #362

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
16 changes: 8 additions & 8 deletions test/rank/feasible-tree-test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,29 +1,29 @@
var expect = require("../chai").expect;
var Graph = require("@dagrejs/graphlib").Graph;
var feasibleTree = require("../../lib/rank/feasible-tree");
let expect = require("../chai").expect;
let Graph = require("@dagrejs/graphlib").Graph;
let feasibleTree = require("../../lib/rank/feasible-tree");

describe("feasibleTree", () => {
it("creates a tree for a trivial input graph", () => {
var g = new Graph()
let g = new Graph()
.setNode("a", { rank: 0 })
.setNode("b", { rank: 1 })
.setEdge("a", "b", { minlen: 1 });

var tree = feasibleTree(g);
let tree = feasibleTree(g);
expect(g.node("b").rank).to.equal(g.node("a").rank + 1);
expect(tree.neighbors("a")).to.eql(["b"]);
});

it("correctly shortens slack by pulling a node up", () => {
var g = new Graph()
let g = new Graph()
.setNode("a", { rank: 0 })
.setNode("b", { rank: 1 })
.setNode("c", { rank: 2 })
.setNode("d", { rank: 2 })
.setPath(["a", "b", "c"], { minlen: 1 })
.setEdge("a", "d", { minlen: 1 });

var tree = feasibleTree(g);
let tree = feasibleTree(g);
expect(g.node("b").rank).to.eql(g.node("a").rank + 1);
expect(g.node("c").rank).to.eql(g.node("b").rank + 1);
expect(g.node("d").rank).to.eql(g.node("a").rank + 1);
Expand All @@ -34,7 +34,7 @@ describe("feasibleTree", () => {
});

it("correctly shortens slack by pulling a node down", () => {
var g = new Graph()
let g = new Graph()
.setNode("a", { rank: 2 })
.setNode("b", { rank: 0 })
.setNode("c", { rank: 2 })
Expand Down