--- In [email protected], "peternilsson42" <[EMAIL PROTECTED]>
wrote:
>
> "sejal patel" <sejalb81@> wrote:
> > I have to find shortest path for given graph for adjacency
> > matrix in c++.
> <snip>
> > but lack of time i cant do this.pls help me to impliment
> > this prog.
>
> We'll gladly help you. What we won't do is write your
> assignment for you. Show us what you've done and where
> you're stuck and we will assist.
>
> --
> Peter
>
actually i have created three files graph.h -for all prototypes.
graph.cpp -for implimetaion of methods and search.cpp for main
program.
Now i can read graph from command line.my logic is if i have matrix
size of 5 then max vertexs are 25 then prog read adjacency matrix and
start reading matrix list.i have done this part.i have created a
structure for node,and i am applying Dijktra's algorithm to find
sorthest path. I am trying to create hash table to store nodes and
traverse and find path.but i am struck here...
One more i have to crate priority quoue for shortest path.
pls help me.
