I forked your gist and fixed it <https://gist.github.com/jexp/43c6ee500e6fe97868df>, hope you like it.
http://gist.neo4j.org/?43c6ee500e6fe97868df <http://gist.neo4j.org/?43c6ee500e6fe97868df> Except the last thing which doesn't work due to Cyphers default relationship-uniqueness (a relationship has to be unique per path) approach. It's possible with Neo4j's traversal & Java APIs though. > Am 26.08.2015 um 17:06 schrieb James Newton <[email protected]>: > > Thanks, Michael. > > All this is new to me. I've created a graphgist of the mini-maze that I used > in my example: > > http://gist.neo4j.org/?9f6627661d370dac98ea > <http://gist.neo4j.org/?9f6627661d370dac98ea> > I've modified your query but in 'cargo cult code' fashion, since I'm out of > my depth here... for now > > May the fun begin! > > James > > > -- > You received this message because you are subscribed to the Google Groups > "Neo4j" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected] > <mailto:[email protected]>. > For more options, visit https://groups.google.com/d/optout > <https://groups.google.com/d/optout>. -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
