2024-09-30 01:48:24 发布
网友
我有一套多层次/深度的分类:
1. A - A1 - A11 - A12 - A121 - A122 -A2 2. B 3. C - C1 - C2
我需要
l=[A->;[A1]->;[A12]->;[A121,A122]]
例如:
首先,对于测试,我将手动创建结构,但我希望稍后从CSV导入
您可以使用第三方Python包,称为anytree formhttps://pypi.org/project/anytree/
pip install anytree
from anytree import Node, RenderTree A = Node("A") A1 = Node ("A1", parent=A) A11 = Node("A11", parent = A1) A12 = Node("A12", parent = A1) A121 = Node("A121", parent = A12) A122 = Node("A122", parent = A12) A2 = Node("A2", parent=A1) B = Node("B") C = Node("C") C1 = Node("C1", parent=C) C2 = Node("C2", parent=C) print (A) print(A122) for pre, fill, node in RenderTree(A): print("%s%s" % (pre, node.name))
输出
============= RESTART: C:/Python36/MyTestScripts/anytree_test.py ============= Node('/A') Node('/A/A1/A12/A122') A └── A1 ├── A11 ├── A12 │ ├── A121 │ └── A122 └── A2 >>>
您可以使用第三方Python包,称为anytree formhttps://pypi.org/project/anytree/
你知道吗代码.py你知道吗
输出
相关问题 更多 >
编程相关推荐