dig/test/dig/alg/topsort-test.js

Graph algorithms

require("../../test-env");

var graphs = require("../../test-graphs");

describe("dig.alg.topsort", function() {
  it("handles node1 graph", function() {
    assert.deepEqual([1], dig.alg.topsort(graphs.directed.node1));
  });

  it("handles node2 graph", function() {
    var results = dig.alg.topsort(graphs.directed.node2);
    assert.deepEqual([1, 2], results.sort());
  });

  it("handles edge1 graph", function() {
    assert.deepEqual([1, 2], dig.alg.topsort(graphs.directed.edge1));
  });

  it("handles edge2 graph", function() {
    assert.deepEqual([1, 2, 3], dig.alg.topsort(graphs.directed.edge2));
  });

  it("throws an error for selfLoop graph", function() {
    assert.throws(function() { dig.alg.topsort(graphs.directed.selfLoop); });
  });

  it("throws an error for cycle2 graph", function() {
    assert.throws(function() { dig.alg.topsort(graphs.directed.cycle2); });
  });

  it("handles diamond graph", function() {
    var results = dig.alg.topsort(graphs.directed.diamond);
    assert.equal(4, results.length);
    assert.equal(1, results[0]);
    assert.equal(4, results[3]);
    assert.isTrue((results[1] == 2 && results[2] == 3) ||
                  (results[1] == 3 && results[2] == 2));
  });

  it("throws an error for nestedCycle2 graph", function() {
    assert.throws(function() { dig.alg.topsort(graphs.directed.nestedCycle2); });
  });

  it("throws an error for undirected graphs", function() {
    assert.throws(function() { dig.alg.topsort(graphs.undirected.node1); });
  });
});