## Algorithms

Moderators: None (Apply to moderate this forum)
Number of posts: 762

This Forum Only

Greedy algoritm Problem Posted by gauravdott on 7 Mar 2008 at 11:04 AM
Hi, I am new to algorithms and i have following assingment to do, although i understand Greedy algorithm but i have no idea how to proceed

1. Prove that a graph with n nodes and more than n-1 edges must contain at least one cycle.

2. Suppose the cost of laying a telephone cable from point a to point b is proportional to the Euclidean distance from a to b. A certain number of towns are to be connected at minimum cost. Find an example where it costs less to lay are connected at minimum cost. Find an example where it costs less to lay the cables via an exchange situated in between the towns than to use only direct links.

## Recent Jobs

Official Programmer's Heaven Blogs
Web Hosting | Browser and Social Games | Gadgets

Popular resources on Programmersheaven.com
Assembly | Basic | C | C# | C++ | Delphi | Flash | Java | JavaScript | Pascal | Perl | PHP | Python | Ruby | Visual Basic