underlying_undirected_graph (304B)
1 # Underlying undirected graph 2 3 Given a [directed_graph] G = (V, E), construct an [undirected_graph] G' = (V, E') by taking E' = {{u, v} \mid (u,v) \in E}. 4 5 - May contain [multiedges] if some vertices are connected by an edge in both directions 6 - May contain [self_loops] if G did 7 8 Up: [graph_operations]