pub fn map_graph_triangular( num_vertices: usize, edges: &[(usize, usize)], ) -> MappingResult
Map a graph to a triangular lattice grid graph using optimal path decomposition.
Panics if num_vertices == 0.
num_vertices == 0