Sign in to follow this  

Directed graph problem

Recommended Posts

Hi, I am looking to find the size of the largest set of non-intersecting paths between given points A and B in a directed graph. As an example, you're a state coordinator and you have towns, and roads between towns. Several groups want to have a parade that day from town A to town B. Each group's parade would take up the whole parade route at once, because of the decorations involved, so they can't share any roads that day. How many parades between towns A and B, given a set of towns and roads, can be accommodated simultaneously? All of the roads are one-way (directed) although it's possible (in my application) for two towns to have two or more roads running directly between them, possibly in differing directions. Finding the actual routes needed to solve this is not relevant to me, only finding the number. That's the sort of algorithm I'm looking for. Does anyone have any ideas that might help?

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this