Dijkstra's algorithm

there is a data file of 100 rows and 100 entries per row, these represent a graph with 100 nodes, and the weight of the edges between the nodes. This is a connected undirected graph.

Use dijkstra's algorithm to calculate the shortest distance between node 23 and node 47. The output should be a path from node 23 to node 47.

Use prim's or lruskal's algorithm to calculate the minimum spanning tree for the graph. The output should be a list of the edges that are in the minimum spanning tree.

A very simple program!!

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

unix

Programação C Engenharia MySQL PHP Arquitetura de software Teste de Software

ID do Projeto: #3189734

Sobre o projeto