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

Marked check cycle done.

Browse Source
This commit is contained in:
John Washam 2016-08-01 21:13:31 -07:00
parent ed91fa30b6
commit 02dc197b6f
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -684,9 +684,9 @@ Graphs can be used to represent many problems in computer science, so this secti
- [ ] 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):
- [x] check for cycle (needed for topological sort, since we'll check for cycle before starting)
- [ ] topological sort - [ ] topological sort
- [x] count connected components in a graph - [x] count connected components in a graph
- [ ] check for cycle
- [ ] list strongly connected components - [ ] list strongly connected components
- [ ] check for bipartite graph - [ ] check for bipartite graph