beta-nu-theta-chi/big-brother-tree
1
0
Fork 0
mirror of https://github.com/beta-nu-theta-chi/big-brother-tree.git synced 2025-12-01 00:24:47 +00:00
Code Issues Projects Releases Wiki Activity

remove old conversion script

Browse Source
This commit is contained in:
tnichols217 2025-10-23 13:14:09 -04:00
parent 2e0ff8f551
commit 8447f869a0
No known key found for this signature in database
1 changed files with 0 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
convert.py
View File

@ -1,18 +0,0 @@
def simplify_dot(input_path: str, output_path: str):
edges: dict[str, list[str]] = {}
with open(input_path, 'r', encoding='utf-8') as f:
for line in f:
parts = "".join([i for i in line if i not in "\t\n;"]).split(" -> ")
if parts[0] not in edges:
edges[parts[0]] = []
edges[parts[0]].append(parts[1])
with open(output_path, 'w', encoding='utf-8') as f:
for src, targets in sorted(edges.items()):
parts = [f"\"{t}\"" for t in targets]
target_str = "{ " + f"{" ".join(targets)}" + " }" if len(targets) > 1 else targets[0]
print(target_str)
f.write(f"{src} -> {target_str}\n")
simplify_dot("line.dot", "simp.dot")