![]() |
|
![]() |
|
|
Thread Tools | Display Modes |
|
|
|
|
#1 |
|
Newbie
Join Date: May 2006
Posts: 1
Rep Power: 0
![]() |
Hi all,
i have a task of finding the shortest path in the graph..i made it in C language and now my next task is to change it into the parallel solution using MPI..but i cant understand how to do it PRECISELY...can someone help me with that??if so then i would like to post my C code as well... please try to help me as soon as possible.. i will be waiting for any replies. Regards. Last edited by cutiepie; May 4th, 2006 at 7:00 PM. |
|
|
|
![]() |
| Bookmarks |
| Currently Active Users Viewing This Thread: 1 (0 members and 1 guests) | |
| Thread Tools | |
| Display Modes | |
|
|