Topological sort: Difference between revisions

class Graph {

String[] vertices;

int numVertices;

 

vertices = s.split(",");

numVertices = vertices.length;

 

for (int[] edge : edges)

}

 

boolean hasDependency(Integer r, List<Integer> todo) {

for (Integer c : todo) {

return true;

}