Check for a path from a to b with C in the path

Question

1.00/5 (1 vote)

See more:

Given 3 nodes, a,b,c check if there are paths existing from a to b and c to b with no common vertex other than b exists

What I have tried:

I am very new to this kind of problem. So, don't know how to proceed

Posted 15-Jun-17 21:37pm

Member 13262666

Updated 15-Jun-17 22:48pm

Add a Solution

Comments

Richard MacCutchan 16-Jun-17 3:45am

Does this have something to do with programming?

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)

CPallini · Answer 1 · 2017-06-15T22:48:00

Solution 1

If b is a common vertex then there is a path both from a to b and from c to b.

Posted 15-Jun-17 22:48pm

CPallini