Anonymous user
Topological sort: Difference between revisions
→{{header|Java}}: adjacency entries are only 1 or 0, so are booleans
(→{{header|Java}}: adjacency entries are only 1 or 0, so are booleans) |
|||
Line 2,389:
class Graph {
String[] vertices;
int numVertices;
Line 2,395:
vertices = s.split(",");
numVertices = vertices.length;
adjacency = new
for (int[] edge : edges)
adjacency[edge[0]][edge[1]] =
}
Line 2,430:
boolean hasDependency(Integer r, List<Integer> todo) {
for (Integer c : todo) {
if (adjacency[r][c]
return true;
}
| |||