像下面这个例子，T1 -> K1 -> K2 ->K3 -> T2 -> K4 -> K5 -> T3，分别为T，K两种label，要删除K标签的关系，并将T之间连线，最后形成T1 -> T2 ->T3，这里T1不能连到T3。 Cyper不熟，研究了几个小时，没搞出来。 图的构建语句： create (t1:T{Code:‘T1’}),(t2:T{Code:‘T2’}),(t3:T{Code:‘T3’}),(k1:K{Code:‘K1’}),(k2:K{Code:‘K2’}),(k3:K{Code:‘K3’}),(k4:K{Code:‘K4’}),(k5:K{Code:‘K5’}); match (t1:T{Code:‘T1’}),(t2:T{Code:‘T2’}),(t3:T{Code:‘T3’}),(k1:K{Code:‘K1’}),(k2:K{Code:‘K2’}),(k3:K{Code:‘K3’}),(k4:K{Code:‘K4’}),(k5:K{Code:‘K5’}) create (t1)-[r1:test]->(k1), (k1)-[r2:test]->(k2),(k2)-[r3:test]->(k3),(k3)-[r4:test]->(t2),(t2)-[r5:test]->(k4),(k4)-[r6:test]->(k5),(k5)-[r7:test]->(t3);