pub fn graph_intersection(g1: &Graph, g2: &Graph) -> Graph
Return the intersection of two graphs.
The intersection contains nodes in both graphs and edges in both graphs. Matches networkx.intersection(G, H).
networkx.intersection(G, H)