Hi Michael,
Sadly on stackoverflow i had no usefull answer; I'm still blocked on how to
find N shortest weighted paths in neo4j; can I use any other utility in
order to calculate it (e.g. gremlins, graphjung or other?)
I'ld like to create a new graphgist by dumping my full DB but in my DB I
actually have 400000 nodes, 4 Million of relationships and 3 Million of
properties.......I think I can't dump and upload the full DB; so my
graphgist would contain only the chyper query I'm trying....is it enough
for you?
thank you
Antonio
Il giorno martedì 25 marzo 2014 09:20:19 UTC+1, Antonio Grimaldi ha scritto:
>
> i tried to execute this cypher query :
>
> StringBuilder sb = new StringBuilder("START startNode = node(269604),
> endNode = node(269605)
> MATCH path=(startNode)-[:CAR_MAIN_NODES_RELATION*]->(endNode)
> RETURN path AS shortestPath, reduce(cost=0, rel in relationships(path) |
> cost + rel.edgeLength) AS totalCost
> ORDER BY totalCost ASC
> LIMIT 3")
>
> ResourceIterator<Object> pathsList = this.executionEngine.execute(sb.
> toString()).columnAs("shortestPath");
>
> but, after 10 minutes, I have not had any results yet...
>
> My graph had 157689 nodes and 1063621 edges.
>
--
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.
