From 486c43416dd6f8fbc1db35926fc4e4686cd31777 Mon Sep 17 00:00:00 2001 From: John Washam Date: Thu, 21 Jul 2016 11:44:26 -0700 Subject: [PATCH] Removed note. --- README.md | 8 +------- 1 file changed, 1 insertion(+), 7 deletions(-) diff --git a/README.md b/README.md index 41ba639..3c75156 100644 --- a/README.md +++ b/README.md @@ -618,9 +618,7 @@ Then test it out on a computer to make sure it's not buggy from syntax. ## Graphs - This area is sparse (no pun intended), and I'll be filling it in once I get here. - -- Notes: +- Notes from Yegge: - There are three basic ways to represent a graph in memory: - objects and pointers - matrix @@ -658,10 +656,6 @@ Then test it out on a computer to make sure it's not buggy from syntax. - Full Coursera Course: Algorithms on Graphs: https://www.coursera.org/learn/algorithms-on-graphs/home/welcome -- Implement: - - [ ] Dijkstra's algorithm - - [ ] A* - - For Curiosity: - [ ] Speeding up Dijkstra: https://www.youtube.com/watch?v=CHvQ3q_gJ7E - covers Fibonacci heap, a more complicated but more efficient heap than binary heap