Python Pandas获取层次路径直到顶层管理

IIUC，你可以用networkx构建一个有向图，然后找到每个 node 和'0'之间的shortest_path，然后用它映射path_variable:

import networkx as nx

G = nx.from_pandas_edgelist(df, source='m_eid', target='eid',
                            create_using=nx.DiGraph)

s = df.set_index('eid')['path_variable']

mapper = {n: '|'.join(s.get(x, '') for x in 
                      nx.shortest_path(G, source='0',
                                       target=n)[1:])
          for n in df['eid'].unique()
         }
df['complete_path'] = df['eid'].map(mapper)

输出:

   eid m_eid level path_variable complete_path
0    1     0     0             0             0
1    2     1     1             0           0|0
2    3     1     1             1           0|1
3    4     2     2             0         0|0|0
4    5     2     2             1         0|0|1
5    6     2     2             2         0|0|2
6    7     3     2             0         0|1|0
7    8     3     2             1         0|1|1
8    9     3     2             2         0|1|2
9   10     3     2             3         0|1|3
10  11     4     3             0       0|0|0|0
11  12     4     3             1       0|0|0|1
12  13    10     3             0       0|1|3|0

图表:

如果eid中已经有了唯一值，则可以避免映射器并使用用途:

df['complete_path'] = ['|'.join(s.get(x, '') for x in 
                       nx.shortest_path(G, source=n,
                                        target='0')[-2::-1])
                       for n in df['eid']]

为了更容易理解，这里有一个更classic 的路径， node id(而不是path_variables):

mapper = {n: '|'.join(nx.shortest_path(G, source='0',
                                       target=n)[1:])
          for n in df['eid'].unique()
         }
df['complete_path'] = df['eid'].map(mapper)

输出:

   eid m_eid level path_variable complete_path
0    1     0     0             0             1
1    2     1     1             0           1|2
2    3     1     1             1           1|3
3    4     2     2             0         1|2|4
4    5     2     2             1         1|2|5
5    6     2     2             2         1|2|6
6    7     3     2             0         1|3|7
7    8     3     2             1         1|3|8
8    9     3     2             2         1|3|9
9   10     3     2             3        1|3|10
10  11     4     3             0      1|2|4|11
11  12     4     3             1      1|2|4|12
12  13    10     3             0     1|3|10|13