父)作为 csv(700,000 行)输入
Child Parent
fA00 f0
fA9 fA0
fA31 fA0
fA30 fA0
fA1 fA00
dccfA1 fA00
fA2 fA00
fA3 fA00
fA01 fA00
fA4 fA00
fA5 fA00
fA6 fA00
fA7 fA00
fA0 fA00
fA142149 fA00
fA02 fA00
fA8 fA00
qA1 fA10
fA22 fA10
fA23 fA10
fA11 fA10
qA2 fA10
fA15 fA11
fA13 fA11
fA12 fA11
fA14 fA13
fA17 fA16
fA18 fA17
fA19 fA17
fA20 fA17
fA21 fA19
etc....
Run Code Online (Sandbox Code Playgroud)
它上升到 14 级深。顶级父级是 f0
我想遍历子父关系以确定路径
预期结果
f0 --- top
f0\fa00
f0\fa00\.Child
f0\fa00\.Child2etc …Run Code Online (Sandbox Code Playgroud)