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

Marking completed items.

Browse Source
This commit is contained in:
John Washam 2016-07-31 21:57:44 -07:00
parent 6e5bc9fbd0
commit 50421305af
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
README.md
View File

@ -676,14 +676,14 @@ Graphs can be used to represent many problems in computer science, so this secti
- [x] A* Pathfinding (E01: algorithm explanation): https://www.youtube.com/watch?v=-L-WgKMFuhE - [x] A* Pathfinding (E01: algorithm explanation): https://www.youtube.com/watch?v=-L-WgKMFuhE
- I'll implement: - I'll implement:
- [ ] DFS with adjacency list - [x] DFS with adjacency list (recursive)
- [ ] DFS with adjacency matrix - [ ] DFS with adjacency matrix (iterative with stack)
- [ ] BFS with adjacency list - [ ] BFS with adjacency list
- [ ] BFS with adjacency matrix - [ ] BFS with adjacency matrix
- [x] single-source shortest path (Dijkstra) - [x] single-source shortest path (Dijkstra)
- DFS-based algorithms (see Aduni videos above): - DFS-based algorithms (see Aduni videos above):
- [ ] topological sort - [ ] topological sort
- [ ] count connected components in a graph - [x] count connected components in a graph
- [ ] check for cycle - [ ] check for cycle
- [ ] list strongly connected components - [ ] list strongly connected components
- [ ] check for bipartite graph - [ ] check for bipartite graph