AlgoGraphJava - UCSD Coursera Graph Algorithms done in Java

Age	Commit message (Collapse)	Author
2020-07-14	Strongly Connected Component done. It's easy after I struggled with ↵	Haidong Ji
	topological sorting.
2020-07-12	Finally Topological sort done! I started from scratch and used Array, not ↵	Haidong Ji
	ArrayList, in dfs and explore methods, which helped! I also used IntStream and boxed method to do clever post order array sorting.
2020-07-10	Checking in implementation with stack. Didn't pass the grader. I'm checking ↵	Haidong Ji
	in first and then start from scratch.
2020-05-23	Topological sort not done yet. The program is correct but not efficient. I ↵	Haidong Ji
	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-20	Check if DAG (Directed Acyclic Graph) done. In the exercise it's Checking ↵	Haidong Ji
	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-16	ConnectedComponents (Adding Exits to Maze) done. I didn't build my test ↵	Haidong Ji
	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-10	Reachability done. I found it much easier to work with Java than Python. I ↵	Haidong Ji
	tried to start with Python but found it difficult to get started.