Topic: optimal-meeting-nodes Goto Github

👇 Here are 1 public repositories matching this topic...

turcavasileionut / graphhero
optimal-meeting-nodes,A graph editor where introduce the list of edges and draw the graph using matplotlib. It is displayed if it is eulerian. Your graph can be directed or unoriented, weighted or unweighted. You can introduce 2 nodes and see the distance between and an optimal meeting node between them. You can save the list of edges or the plot of the graph. You can see the minimum cost partial tree.
User: turcavasileionut
graph graph-editor optimal-meeting-nodes eulerian edges