# See Networkx's docuemntation -- https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html

import networkx as nx
from sage.graphs.graph_input import from_networkx_graph

# Convert Prufer code to a tree

code = [i-1 for i in [6, 6, 4, 3, 1, 4, 3]] # In networkx, node-labeling starts with 0
g_nx = nx.from_prufer_sequence(code)
list(g_nx.edges())

# Convert the Networkx graph to a Sagemath graph

g_sage = Graph()
from_networkx_graph(g_sage, g_nx)
g_sage

# A second example.

code = [i-1 for i in [7, 5, 5, 3, 1]]
g_nx = nx.from_prufer_sequence(code)
g_sage = Graph()
from_networkx_graph(g_sage, g_nx)
g_sage