Neo4j Fundamentals - Graph Structure

[Sergedev]

On the page Graph Structure the question is "How many unique paths are traversed to go from Springfield to Centerville?"

The answer (the accepted one) is 3 but I seems to have found 4 paths :

- springfield, newtown,centerville

- springfield, newtown, cliffside, melrose, centerville

-springfield, cliffside, newton, centerville

-springfield, cliffside, melrose, centerville.

Link to nodes' picture 

[adam_cowley]

Hey @Sergedev , this is a good point.  The path Springfield - Newtown - Cliffside - Melrose - Centerville would be valid if you ignore the direction of the relationships.  However, if you consider the direction of the relationship, you can't travel from Newtown to Cliffside.

I will make sure  that this clearer in the question.