Re: A cycle with minimum length
- From: "Phlip" <phlipcpp@xxxxxxxxx>
- Date: Sat, 31 Mar 2007 14:52:54 GMT
Mahdi wrote:
Hello everyone!
We have n points in a chart that none of them have the same length(I
mean their 'x' parameter). We want to find a cycle with MINIMUM length
"Minimum cost spanning tree" or "..cycle" is well-described, and one of the
simplest graph algorithms possible. It's how most of our modern technology
works, including the Adaptive Routing on the Internet.
Just Google for it, and Google will use it to find you one!
--
Phlip
http://flea.sourceforge.net/PiglegToo_1.html
.
- References:
- A cycle with minimum length
- From: Mahdi
- A cycle with minimum length
- Prev by Date: Re: A cycle with minimum length
- Next by Date: Re: Implementing a Network Protocol
- Previous by thread: A cycle with minimum length
- Index(es):
Relevant Pages
|