Computing number of simple paths

Asked by Gagan on 2013-08-20

Hi, I am interested in computing total number of simple paths(no node repeated) between two nodes in a graph(sparse, directed and contains cycles). Does this library has functions to do so?

I tried using dfs(A,u) but that only gives distance along the first path it encounters. Also what do the other fields dt ,ft and pred represent? Small examples would be of great help.

Thanks!
Gagan

Question information

Language:
English Edit question
Status:
Answered
For:
Matlab BGL Edit question
Assignee:
No assignee Edit question
Last query:
Last reply:
Revision history for this message
David Gleich (dgleich) said :
#1

There is no such function.

On Tuesday, August 20, 2013 at 12:16 PM, Gagan wrote:

> New question #234341 on Matlab BGL:
> https://answers.launchpad.net/matlab-bgl/+question/234341
>
> Hi, I am interested in computing total number of simple paths(no node repeated) between two nodes in a graph(sparse, directed and contains cycles). Does this library has functions to do so?
>
> I tried using dfs(A,u) but that only gives distance along the first path it encounters. Also what do the other fields dt ,ft and pred represent? Small examples would be of great help.
>
> Thanks!
> Gagan
>
> --
> You received this question notification because you are an answer
> contact for Matlab BGL.
>

Can you help with this problem?

Provide an answer of your own, or ask Gagan for more information if necessary.

To post a message you must log in.