Search found 1 match

Go to advanced search

by Ken Lin
Sun Dec 07, 2003 6:26 pm
Forum: Volume 103 (10300-10399)
Topic: 10319 - Manhattan
Replies: 9
Views: 6754

Re: 10319 - Manhattan

I try to formulate this problem as a two-coloring problem.
My idea is that I treat each pair of input point as a single node.
And for each pair of node, if their desired paths may conflict, they are
joined by an edge. Then I just check this graph to see if it is two-colorable.
But this idea seems ...

Go to advanced search