How do I find path from s to t with length < = k with most 'red' nodes?

Question

0.00/5 (No votes)

See more:

Hi guys,
im a little rusty on my algorithms so maybe you can help me.
given an undirected graph (V,E) and a number K and suppose some of the vertices are 'red' and the others are 'blue'.
how can i find a path with length <= K from s to t that passes the most red vertices?

thanks

What I have tried:

i tried looking for a path with length 1, than 2, ... till K but it still doesnt go through the maximal amount of red vertices.

Posted 25-May-16 2:05am

Member 12545525

Updated 26-May-16 15:24pm

Patrice T

v2

Add a Solution

Comments

Sergey Alexandrovich Kryukov 25-May-16 11:34am

It looks like the only solution is brute force: find all paths and calculate number of red vertices for each, find the one with maximum red vertices.
—SA

Patrice T 25-May-16 15:26pm

What have you done already ?
Post your code.
Use Improve question to update your question.
So that everyone can pay attention to this information.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Patrice T · Answer 1 · 2016-05-26T15:24:00

Solution 1

Quote:
how can i find a path with length <= K from s to t that passes the most red vertices?

The solution is brut force.
You have to try all possible path one by one and save the best answer so far.

Posted 26-May-16 15:24pm