【发布时间】:2020-07-22 12:41:16
【问题描述】:
有没有办法将两个子树返回为不包括“B”关系的树结构?我的愿望是生成一个 JSON 描述两个子树的层次结构,格式如下
{
"graph":{
"food": {
"attr1":"some attr",
"children": {
"pizza":{
"attr1":"some attr",
"children":{
"pizza1":{
"attr1":"some attr"
},
"pizza2":{
"attr1":"some attr"
},
"pizza3":{
"attr1":"some attr"
}
}
},
"pie":{
"attr1":"some attr",
"children":{}}
}
},
"topping": {
"attr1":"some attr",
"children": {
"meat":{
"attr1":"some attr",
"children":{
"pepperoni":{
"attr1":"some attr"
},
"beef":{
"attr1":"some attr"
}
}
},
"vegetables":{
"attr1":"some attr",
"children":{
"onion":{
"attr1":"some attr"
},
"eggplant":{
"attr1":"some attr"
}
}
}
}
}
}
}
我知道 Neo4j 有 APOC 插件,但我不知道它是否可以用于这样的事情。
【问题讨论】:
标签: json graph neo4j tree cypher