I am looking into nested graphs and have not found an answer to a specific case. Generally, when a node from one level links to a node in a sub graph, the edge should be defined in the outer graph. In the case where two nodes are in two different (peer) subgraphs at the same level, should the edge go in the outer level that contains them both? See edge e4 below.
<?xml version="1.0" encoding="UTF-8"?> <graphml xmlns="http://graphml.graphdrawing.org/xmlns"; xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"; xsi:schemaLocation="http://graphml.graphdrawing.org/xmlns http://graphml.graphdrawing.org/xmlns/1.0/graphml.xsd";> <graph id="G" edgedefault="undirected"> <node id="n0"/> <graph id="n5:" edgedefault="undirected"> <node id="n5::n1"/> <node id="n5::n2"/> <edge id="e0" source="n5::n1" target="n5::n2"/> </graph> </node> <node id="n1"> <graph id="n6:" edgedefault="undirected"> <edge id="e1" source="n6::n1" target="n6::n2"/> </graph> </node> <edge id="e2" source="n5::n2" target="n0"/> <edge id="e3" source="n0" target="n2"/> <edge id="e4" source="n6::n1" target="n5::n2"/> </graph> </graphml> Thanks, -Paul _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
