Hi,
Is there a way to specify a query which returns an intact subgraph?
For example:
starting from node "X" (by some specification), return the subgraph
reachable through a collection of relationship types {T}, through some
maximum distance (d), return a JSON representation of this subgraph -
possibly with some WHERE specifications, but possibly not. In our nodes
we include a nodetype in every node, we might want to say "WHERE
node.nodetype IN {N}" as our where clause.
Result should be in some JSON graph format, perhaps like JSON Graph
Format (JGF) http://jsongraphformat.info/ or
https://github.com/bruth/json-graph-spec.
This is exactly what's needed for visualization of a subgraph from a
Javascript program. Since Neo4j graphs are often huge, even monstrous,
having a query that does this would be incredibly handy...
Otherwise you have to go through and put this graph together a piece at
a time (or so it seems to me).
I think I can write a query which returns all the paths through this
subgraph, but then I have to do the duplication elimination and so on
myself. A single node might be returned many times in the possible paths
result. Not an ideal situation...
This seems like a very common thing to want to do...
--
Alan Robertson / CTO
al...@assimilationsystems.com <mailto:al...@assimilationsystems.com>/ +1
303.947.7999
Assimilation Systems Limited
http://AssimilationSystems.com
Twitter <https://twitter.com/ossalanr> Linkedin
<https://www.linkedin.com/in/alanr> skype
<https://htmlsig.com/skype?username=alanr_unix.sh>
--
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 neo4j+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
