6.00SC 2011 Problem Set 11

Since there are no solutions I could check my code against, I'd like some critique on my work.

https://gist.github.com/anonymous/7288630

I guess in hindsight the provided Edge class and my CampusEdge class were pretty useless.
I am also wondering why for problem 3 you are supposed to generate all paths dfs-style and then find the best one when a "normal" dfs (as opposed to the more clever one from problem 4) would have explored all paths anyway - yet not stored them all. Thanks.

Question

6.00SC 2011 Problem Set 11

Since there are no solutions I could check my code against, I'd like some critique on my work.

https://gist.github.com/anonymous/7288630

I guess in hindsight the provided Edge class and my CampusEdge class were pretty useless.
I am also wondering why for problem 3 you are supposed to generate all paths dfs-style and then find the best one when a "normal" dfs (as opposed to the more clever one from problem 4) would have explored all paths anyway - yet not stored them all. Thanks.

anonymous · Answer

here are mine, graph.py http://dpaste.com/1451883/ problemset http://dpaste.com/1451887/ I did these for the fall 2012 edX version of the course but they are similar enough for comparison.