Re: [Neo4j] Graph algos in REST

Hi Mattias, > Traversers works the same way (with POST)... I'm almost positive you were > there, Jim, when we decided on not going with the > HTTP-FORM-style-question-mark-parameters-pattern-or-whats-is-called. Or is > this something different? I don't think I was there for traversers - I only re

Re: [Neo4j] Graph algos in REST

2010/9/17 Jim Webber > I'm not convinced I like the way this works: > > > POST /node/123/paths {"to": "http://localhost:/node/456";, > "algorithm": > > "shortestPath", "max depth": 100} > > Isn't the intention to retrieve the shortest path? If so I'd prefer: > > GET > /node/123/paths?to=http

Re: [Neo4j] Graph algos in REST

Until Neo4j supports operations on distributed graphs, couldn't we assume the destination is another node in the same graph and clean that up to: GET /node/123/paths?to=456&algorithm=shortestPath&maxDepth=100 Also, I believe Neo4j only has a stable of reindeer. Would one of them do? /Andreas O

Re: [Neo4j] Graph algos in REST

I'm not convinced I like the way this works: > POST /node/123/paths {"to": "http://localhost:/node/456";, "algorithm": > "shortestPath", "max depth": 100} Isn't the intention to retrieve the shortest path? If so I'd prefer: GET /node/123/paths?to=http%3a%2f%2flocalhost:%2fnode%2f456&al