Name:
Anonymous
2011-02-03 0:42
Hey folks, I have a simple question:
Can any circular graph(undirected, weighted) be used for the travelling sussman problem, or are there any further requirements?
Thanks.
Name:
Anonymous
2011-02-03 3:31
No, your graph needs at least 3 vertices. Traveling from A to B and back doesn't sound like a round trip to me.
Name:
Anonymous
2011-02-03 6:46
>>1
circular graph
Not much of a problem you'll have with it, wouldn't you?
Name:
Anonymous
2011-03-13 4:47
Erika told me that Sussman is a bad boyfriend.
Name:
Anonymous
2011-03-13 6:36
>>4
You still have to calculate which way around it is the fastest!
Name:
Anonymous
2011-03-14 2:53
how is a traveling sussman different from a traveling salesman
Name:
Anonymous
2011-03-14 3:17
>>10
You can't write the solution iteratively, resulting in O(e^n) memory usage instead of O(n^2) memory usage.
Name:
Anonymous
2011-03-14 5:19
>>6
Which Sussman?
The Sussman or some lesser Sussman?