pub fn chinese_postman_problem<E: EdgeTrait>( g: &Graph<Undirected, E>, ) -> E::Weightwhere E::Weight: Copy + Ord + Add<Output = E::Weight> + Zero,
Time complexity $O(V^2 2^V)$