I am not sure of a solution for this, but ain't this an NP-complete problem?
On 6/19/07, ihinayana [EMAIL PROTECTED] wrote:
Description:
Given a group of rectangles with different integer width and
height,such as 5*4, 2*3,1*7,etc. The total number of rectangles is
like 10 or more.The
On 6/19/07, Bin Chen [EMAIL PROTECTED] wrote:
On Jun 15, 9:36 pm, Bart [EMAIL PROTECTED] wrote:
Top post means you reply other's thread in the top of the content. It
is regard as a rude behavior when in USENET.
Because not only you will reply the thread, you must let others know
can anyone please tell me how to find
single source longest path in a directed acyclic graph??
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
On 6/20/07, mirchi [EMAIL PROTECTED] wrote:
can anyone please tell me how to find
single source longest path in a directed acyclic graph??
If all edges are non-negative, you can use Dijkstra's Algorithm. Otherwise a
simple Bellman-Ford should do. But if you are looking for something
click www.new7wonders.com and vote online
For Election of new 7 wonders, please vote for Taj Mahal and make it a wonder
Your vote counts! Help make history...
and vote as many number of times as possible. and make voting
itself an history.
--
PRADEEP MACHARLA
Ph:09411121457
Hey programming freaks,
Check this group out : http://groups.google.co.in/group/programming-challenges
Good one discussing programming problems and algorithms.
Cheers,
AK
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google
