Create an undirected tree graph from its Prüfer sequenceSource:
make_from_prufer() creates an undirected tree graph from its Prüfer
The Prüfer sequence of a tree graph with n labeled vertices is a sequence of n-2 numbers, constructed as follows. If the graph has more than two vertices, find a vertex with degree one, remove it from the tree and add the label of the vertex that it was connected to to the sequence. Repeat until there are only two vertices in the remaining graph.