AlgoGraphJava/src/main, branch masterUCSD Coursera Graph Algorithms done in Java
Dijkstra shortest path done, using PriorityQueue. Don't give up! Very rewarding!2021-07-05T19:38:04+00:00Haidong Ji2021-07-05T19:38:04+00:0041efb7277792e9d1502d305cfd706dd514e24663
Bipartite check done! One of the problems with my code was I ran bfs for all vertex, whereas checking just one is enough! Happy I got it done!2020-07-20T02:31:22+00:00Haidong Ji2020-07-20T02:31:22+00:003929c18515bc46cae10c0e2d66c0c622591eee96
BFS distance done. Following pseudo code, not too bad.2020-07-17T02:06:20+00:00Haidong Ji2020-07-17T02:06:20+00:00d4da45aaeb3799ca813819086c53790e6cb3527d
Strongly Connected Component done. It's easy after I struggled with topological sorting.2020-07-15T02:51:58+00:00Haidong Ji2020-07-15T02:51:58+00:00daaaba9cd6dcaa885c18b7597e2cdc19c2be9726
Finally Topological sort done! I started from scratch and used Array, not ArrayList, in dfs and explore methods, which helped! I also used IntStream and boxed method to do clever post order array sorting.2020-07-13T02:25:07+00:00Haidong Ji2020-07-13T02:25:07+00:00aa6262b550c2fcb417d1ff0a6f4b22ce0c2453e2
Checking in implementation with stack. Didn't pass the grader. I'm checking in first and then start from scratch.2020-07-11T01:23:19+00:00Haidong Ji2020-07-11T01:23:19+00:004008cc6f7eb547d7e93808b9ba9a87fba9acf0e6
Topological sort not done yet. The program is correct but not efficient. I may need to convert the recursive DFS to iterative DFS. Check in now so I can get the code from the computer upstairs.2020-05-24T02:54:17+00:00Haidong Ji2020-05-24T02:54:17+00:00664a4e9667c5cc25b0ea1344b74cb0cbd6f33707
Check if DAG (Directed Acyclic Graph) done. In the exercise it's Checking Consistency of CS Curriculum. For the clock variable to assign pre-visit and post-visit values, I used a trick of defining the clock as int[1], so its mutable and I can increment it. I don't know if that's a best practice, but for now I'm happy that the program is good. Fun stuff!2020-05-20T23:37:36+00:00Haidong Ji2020-05-20T23:37:36+00:00a3d28d9ea91f90af072066b2a77030e929ab0f0e
ConnectedComponents (Adding Exits to Maze) done. I didn't build my test cases properly initially: when v and w are connected, they should be in each other's ArrayList. Once that's fixed, it was easy.2020-05-17T02:22:14+00:00Haidong Ji2020-05-17T02:22:14+00:002dd66619bbd1bf45e092c54f70d89d8f27d269dc
Reachability done. I found it much easier to work with Java than Python. I tried to start with Python but found it difficult to get started.2020-05-10T21:18:46+00:00Haidong Ji2020-05-10T21:18:46+00:00bc5a6815181068e76316aa4a611647124d18ba48