Skip to content
This repository has been archived by the owner on Oct 8, 2021. It is now read-only.

Finding all paths? #845

Closed
dlfivefifty opened this issue Feb 19, 2018 · 4 comments
Closed

Finding all paths? #845

dlfivefifty opened this issue Feb 19, 2018 · 4 comments

Comments

@dlfivefifty
Copy link

I have a directed graph with no circuits, and I want a list/enumeration of all paths between two nodes. Is this functionality implemented?
@sbromberger
Copy link
Owner

I don't believe we have anything like this.

@jpfairbanks
Copy link
Contributor

I would check in the Floyd Warshall code you could probably modify that to calculate the paths in addition to the distances.

@SohamTamba
Copy link
Contributor

A graph with no circuits has no cycles.
You can enumerate the paths of a DAG by modifying DFS.

@sbromberger
Copy link
Owner

Closing this out since there doesn't seem to be any additional discussion happening.

@i-aki-y i-aki-y mentioned this issue Feb 2, 2021
Open
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@sbromberger @dlfivefifty @jpfairbanks @SohamTamba