Nevermind. I figured it out.
Wow this is a really nice problem. It takes a REALLY good understanding of convex hull and the algorithm behind it to figure it out. I didn't have a really good understanding before, but thanks to this problem, I think I can safely say that I do now.
For those who ...
Search found 3 matches
- Sun Sep 17, 2006 11:28 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10135 - Herding Frosh
- Replies: 33
- Views: 19073
- Fri Sep 15, 2006 5:07 am
- Forum: Volume 101 (10100-10199)
- Topic: 10135 - Herding Frosh
- Replies: 33
- Views: 19073
10135
OK. I've looked at previous discussion of this problem, but none help me.
I see that convex hull does not quite give the answer to this problem. I was wondering, what method does give the right answer quick enough?
Does this method use the convex hull as part of it? (I would think that it would ...
I see that convex hull does not quite give the answer to this problem. I was wondering, what method does give the right answer quick enough?
Does this method use the convex hull as part of it? (I would think that it would ...
- Tue May 02, 2006 2:30 am
- Forum: Volume 7 (700-799)
- Topic: 753 - A Plug for UNIX
- Replies: 20
- Views: 15664
753 WA
I can't figure out what would be wrong with this one.
I basically build a graph of the different types of plug/outlet, there being an edge from A to B if A can be plugged into B. I then run a transitive closure algorithm to account for plugging adapters into adapters. Then I run bipartite matching ...
I basically build a graph of the different types of plug/outlet, there being an edge from A to B if A can be plugged into B. I then run a transitive closure algorithm to account for plugging adapters into adapters. Then I run bipartite matching ...