View Code? Open in Web Editor
NEW
This course covers graph theory, data structures, algorithms, and analysis. Key concepts include recursion, greedy algorithms, memoization and dynamic programming. Students will build an original project whose underlying structure requires the use of graph structures and algorithms to solve real-world problems such as airplane routing, social networking, and board games.
License: MIT License
cs-2.2-challenges's Issues
Challenge 2 Feedback : 7/20 . - Updated 13/20
Overall: This code is close, you just need to make sure it runs on sample input before turning in. Debug the edge error and verify it is working.
Feedback based on Challenge 2 Rubric:
Challenge 5 Feedback
Overall: 18/20
Feedback based on Challenge 5 Rubric:
Read and Outputs 4/4
Solves Eulerian ( 4 X 2) 8 /8
Testing 2/4
Does not test Eulerian Method
Documentation & Organization 4/4
0/16 no code or readme submitted
Challenge 1 Feedback: 6/20
Feedback based on Challenge 1 Rubric
Solution: 0
Does not run on sample input without errors
Documentation: 2
Include input/output and runtime in docstrings
Remove commented out code to improve clarity
Organization: 3
Put main challenge_1 code in a main function rather than in global scope
Suggestion: Remove "main" code from graph.py
Testing: 1
Add tests for Graph and file handling
Challenge 3 Feedback
Overall: 19/24 . Nice work
Feedback based on Challenge 3 Rubric:
Read & output 4/4
Graph class 4/4
DFS 4/4
Code organization 3/4
Testing 2/4
some unit tests and exceptions, there could be a lot more.
Documentation 2/4
run pycodestyle to find and fix PEP8 format issues.