An alternative algorithm that works without the explored() function
could be as under.
Just written a rough algorithm, there are a few more optimizations in
loop possible,..
The basi idea used here is -
Post order mean "Data-Left-Right"
If pre-order algorithm be executed with the difference that i
Floyd's algorithm uses DP, and Bellman was the first to introduce
DP..
On Sep 4, 10:13 pm, Ray <[EMAIL PROTECTED]> wrote:
> I think Floyd Bellman method can solve it. We can get any pair
> vertex distance and find the largest one. That's the diameter of a
> graph. But this method is not DP but
I understood that the numbers in the sequences, would not be
consecutive. I used consecutive numbers only because
your example had used consecutive numbers.
Glad you found an answer you liked, Sticker. Looking forward to
reading your pdf file.
--~--~-~--~~~---~--~--
whoops, misunderstood the problem - I thought you meant the sum to the
end of the sequence minus the sum to the end. My bad. Please ignore
what I wrote above!
On 6 Sep, 01:21, "[EMAIL PROTECTED]" <[EMAIL PROTECTED]>
wrote:
> I know you've solved the problem, but I'm bored. Would this work? I
