Explorar el Código

Marked check cycle done.

John Washam hace 8 años
padre
commit
02dc197b6f
Se han modificado 1 ficheros con 1 adiciones y 1 borrados
  1. 1 1
      README.md

+ 1 - 1
README.md

@@ -684,9 +684,9 @@ Graphs can be used to represent many problems in computer science, so this secti
     - [ ] BFS with adjacency matrix
     - [x] single-source shortest path (Dijkstra)
     - DFS-based algorithms (see Aduni videos above):
+        - [x] check for cycle (needed for topological sort, since we'll check for cycle before starting)
         - [ ] topological sort
         - [x] count connected components in a graph
-        - [ ] check for cycle
         - [ ] list strongly connected components
         - [ ] check for bipartite graph