Any suggestions for as to how I can calculate the Euclidean distance between two nodes in a graph? Working with this graph:
nodes = [(\'B\',\'D\'), (\'D\',\'E