topological-sort DAG exception

[andriiheonia]

What wrong with my code? I have an exception "The graph is not a DAG".

var topsort = require('../src/graphs/others/topological-sort').topologicalSort;
var graph = [[0, 1, 0, 0, 1],
             [0, 0, 0, 0, 0],
             [1, 1, 0, 1, 1],
             [0, 0, 0, 0, 0],
             [0, 0, 0, 0, 0]];
var vertices = topsort(graph);

But there is a graph I want to represent:

and it looks directed and acyclic.

[mgechev]

This implementation of the topological sort algorithm accepts graph represented as a list of neighbors.
This means that the invocation, corresponding to your adjust, matrix should look like:

var graph = {};
graph.G1 = ['G2', 'G5'];
graph.G2 = [];
graph.G3 = ['G1', 'G2', 'G4', 'G5'];
graph.G4 = [];
graph.G5 = [];

console.log(topologicalSort(graph));
// ['G3', 'G4', 'G1', 'G5', 'G2']

The graph, which corresponds to your adjust matrix should look differently (since A[i][j] = 1, (i, j) ϵ E), more like this:

As comment I'll add that the required representation of this algorithm is list of neighbors.

I think this issue can be closed.