dagre/test/position-test.js at b9429b677d2768abd9b4de9869bde7971439ece7 · jamesbrauman/dagre · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
var position = require("../lib/position");
var Graph = require("@dagrejs/graphlib").Graph;

describe("position", () => {
  var g;

  beforeEach(() => {
    g = new Graph({ compound: true })
      .setGraph({
        ranksep: 50,
        nodesep: 50,
        edgesep: 10
      });
  });

  it("respects ranksep", () => {
    g.graph().ranksep = 1000;
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 50, height:  80, rank: 1, order: 0 });
    g.setEdge("a", "b");
    position(g);
    expect(g.node("b").y).toBe(100 + 1000 + 80 / 2);
  });

  it("use the largest height in each rank with ranksep", () => {
    g.graph().ranksep = 1000;
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 50, height:  80, rank: 0, order: 1 });
    g.setNode("c", { width: 50, height:  90, rank: 1, order: 0 });
    g.setEdge("a", "c");
    position(g);
    expect(g.node("a").y).toBe(100 / 2);
    expect(g.node("b").y).toBe(100 / 2); // Note we used 100 and not 80 here
    expect(g.node("c").y).toBe(100 + 1000 + 90 / 2);
  });

  it("respects nodesep", () => {
    g.graph().nodesep = 1000;
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 70, height:  80, rank: 0, order: 1 });
    position(g);
    expect(g.node("b").x).toBe(g.node("a").x + 50 / 2 + 1000 + 70 / 2);
  });

  it("should not try to position the subgraph node itself", () => {
    g.setNode("a", { width: 50, height: 50, rank: 0, order: 0 });
    g.setNode("sg1", {});
    g.setParent("a", "sg1");
    position(g);
    expect(g.node("sg1")).not.toHaveProperty("x");
    expect(g.node("sg1")).not.toHaveProperty("y");
  });

  it("aligns nodes to top of rank when rankalign is top", () => {
    g.graph().rankalign = "top";
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 50, height: 60, rank: 0, order: 1 });
    position(g);
    expect(g.node("a").y).toBe(100 / 2);
    expect(g.node("b").y).toBe(60 / 2);
  });

  it("aligns nodes to bottom of rank when rankalign is bottom", () => {
    g.graph().rankalign = "bottom";
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 50, height: 60, rank: 0, order: 1 });
    position(g);
    expect(g.node("a").y).toBe(100 - 100 / 2);
    expect(g.node("b").y).toBe(100 - 60 / 2);
  });

  it("aligns nodes to center of rank when rankalign is center", () => {
    g.graph().rankalign = "center";
    g.setNode("a", { width: 50, height: 100, rank: 0, order: 0 });
    g.setNode("b", { width: 50, height: 60, rank: 0, order: 1 });
    position(g);
    expect(g.node("a").y).toBe(100 / 2);
    expect(g.node("b").y).toBe(100 / 2);
  });
});