Sejal, Did you not see my previous replies. I think I have supplied enough information to get started.
--- sejal patel <[EMAIL PROTECTED]> wrote: > I have to find shortest path for given graph for > adjacency matrix in > c++. > if my in put is: 4 1 5 1 0 1 2 2 2 2 1 3 1 > where 4 is source node and 1 is destination node > 5 is matrix size e.g. 5*5 > and rest of matrix representaion. > 0 1 1 0 1 > 0 0 1 0 0 > 1 0 0 1 0 > 0 1 0 1 0 > 0 0 1 0 1 > > using this matrix find shortest path and how many short > path exist in > graph. > > so i have to make hash table that store > 0->1 2 4 > 1->2 > 2->0 3 > 3->1 3 > 4->2 4 > > but lack of time i cant do this.pls help me to impliment > this prog. > pls pls help me. > > _________________ Joseph A. Marrero http://www.l33tprogrammer.com/ ____________________________________________________________________________________ Looking for a deal? Find great prices on flights and hotels with Yahoo! FareChase. http://farechase.yahoo.com/
