From 02dc197b6fc6ac6743bb57d14ae5a984ed99ca91 Mon Sep 17 00:00:00 2001
From: John Washam <john@readyprompt.com>
Date: Mon, 1 Aug 2016 21:13:31 -0700
Subject: [PATCH] Marked check cycle done.

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 50bc166..845d56c 100644
--- a/README.md
+++ b/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