Finding all paths between two vertices in a graph using c++

[Kanwarpreet]

Hi

Can anyone help me in providing a code in c++ that finds all the paths(from vertex u to vertex v) in a graph.

I am working on directed graphs.

I will be really grateful to you.

Regards
Kanwar

[Zhuge]

Sure, but what's the problem?

[Kanwarpreet]

Actually i dont know how to code .

My graph has:

a1->b1->b3
a2->b2->b3
b1->c1
b2->c1->c2
b3->c2->c3
c1->d1->d2
c2->d1
c3->d1->d2

I have stored the nodes in a text file(separate text for each node that stores the node weights and the nodes adjacent to it). And all these node files form there separate linked list.(Also I dont know how to represnt them to get adjacency list)

Also I have a text file for edges that stores the edge weights with source and destination specified.

Now since there is a path from a1->c1 (via a1->b1 and b1->c1), I dont know how to reach through this path as I need the value of these edges(a1->b1 and b1->c1)
to perform some calculations.


Regards
Kanwar

[huike]

Actually i dont know how to code .

...uhm
The purpose of this forum isn't to find people to write your programs for you...

Here you go
http://www.cplusplus.com/forum/jobs/

[Kanwarpreet]

Thanks dear but still if i get some pseudo code from some one or some small piece of code that can help me in writing this I would be really grateful.

Regards
Kanwar