# -*- coding:utf-8 -*- import json # 递归打印解析节点及路径 def recursion(node_dict, node): if len(node_dict) == 0: tmp.append(node) else: for i in node_dict: recursion(i.get('subNodes'), node+'-->'+i.get('node')) f = open('a.txt') for line in f: data = json.loads(line) node = data.get('node') tmp = [] recursion(data.get('subNodes'), node) for i in tmp: print(node, ':', i) # 一行输出 # print(';'.join(tmp)) f.close()
输出结果:
a : a-->a1-->a11-->a111 a : a-->a1-->a11-->a112 a : a-->a1-->a12 a : a-->a2 b : b-->b1-->b11-->b111