gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Removed note.

Browse Source
This commit is contained in:
John Washam
2016-07-21 11:44:26 -07:00
parent 9beddda32d
commit 486c43416d
1 changed files with 1 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
README.md
View File

@ -618,9 +618,7 @@ Then test it out on a computer to make sure it's not buggy from syntax.
## Graphs ## Graphs
This area is sparse (no pun intended), and I'll be filling it in once I get here. - Notes from Yegge:
- Notes:
- There are three basic ways to represent a graph in memory: - There are three basic ways to represent a graph in memory:
- objects and pointers - objects and pointers
- matrix - 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 - Full Coursera Course: Algorithms on Graphs: https://www.coursera.org/learn/algorithms-on-graphs/home/welcome
- Implement:
- [ ] Dijkstra's algorithm
- [ ] A*
- For Curiosity: - For Curiosity:
- [ ] Speeding up Dijkstra: https://www.youtube.com/watch?v=CHvQ3q_gJ7E - [ ] Speeding up Dijkstra: https://www.youtube.com/watch?v=CHvQ3q_gJ7E
- covers Fibonacci heap, a more complicated but more efficient heap than binary heap - covers Fibonacci heap, a more complicated but more efficient heap than binary heap