fn find_best_eulerian_circuit(
graph: &DHashMap<usize, DockNode>,
) -> Option<(Vec<Vec<usize>>, Vec<usize>, usize, f32, usize)>Expand description
Find the best Eulerian circuit for the given graph of dock nodes. Try each node as the starting point for a circuit. The best circuit is the one with the longest routes (sub-segments of the circuit), and where the route lengths are equal as possible.