76     let mut gr = Graph::new();  in dfs()  localVariable
102     let mut gr = Graph::new();  in dfs_order()  localVariable
131     let mut gr = Graph::new();  in bfs()  localVariable
170     let mut gr = Graph::new();  in selfloop()  localVariable
191     let mut gr = Graph::new();  in cyclic()  localVariable
227         let mut gr = Graph::new_undirected();  in bipartite()  localVariable
256         let mut gr = Graph::new_undirected();  in bipartite()  localVariable
297     let mut gr = Graph::new();  in multi()  localVariable
307     let mut gr = Graph::new();  in iter_multi_edges()  localVariable
337     let mut gr = Graph::new_undirected();  in iter_multi_undirected_edges()  localVariable
372         let mut gr = Graph::new();  in update_edge()  localVariable
384         let mut gr = Graph::new_undirected();  in update_edge()  localVariable
697     let mut gr = Graph::<_, _>::new();  in test_toposort()  localVariable
746     let mut gr = Graph::<_, _>::new();  in is_cyclic_directed()  localVariable
804     let gr: Graph<(), ()> = Graph::from_edges(&[  in scc()  localVariable
856     let mut gr = Graph::new();  in scc()  localVariable
873     let mut gr = Graph::<(), ()>::new();  in scc()  localVariable
886     let gr: Graph<(), ()> = Graph::from_edges(&[  in tarjan_scc()  localVariable
934     let mut gr = Graph::new();  in tarjan_scc()  localVariable
953     let mut gr = Graph::<(), ()>::new();  in tarjan_scc()  localVariable
968     let gr: Graph<(), ()> = Graph::from_edges(&[  in condensation()  localVariable
1006     let mut gr = Graph::new();  in connected_comp()  localVariable
1036     let gr = gr.into_edge_type::<Undirected>();  in connected_comp()  localVariable
1043     let mut gr = Graph::<_, ()>::new();  in oob_index()  localVariable
1052     let mut gr = Graph::<_, _, Directed, usize>::with_capacity(0, 0);  in usize_index()  localVariable
1067     let mut gr = Graph::<_, (), Undirected, u8>::with_capacity(0, 0);  in u8_index()  localVariable
1076     let mut gr = Graph::<_, (), Undirected, u8>::with_capacity(0, 0);  in u8_index_overflow()  localVariable
1085     let mut gr = Graph::<_, (), Undirected, u8>::with_capacity(0, 0);  in u8_index_overflow_edges()  localVariable
1095     let mut gr = Graph::<_, _>::new();  in test_weight_iterators()  localVariable
1148     let mut gr = Graph::<_, _>::new();  in walk_edges()  localVariable
1191     let mut gr = Graph::<_, _>::new();  in index_twice_mut()  localVariable
1240     let mut gr = Graph::default();  in make_edge_iterator_graph()  localVariable
1266     let gr = make_edge_iterator_graph::<Directed>();  in test_edge_iterators_directed()  localVariable
1337     let gr = make_edge_iterator_graph::<Directed>();  in test_edge_filtered_iterators_directed()  localVariable
1360     let gr = make_edge_iterator_graph::<Directed>();  in test_node_filtered_iterators_directed()  localVariable
1380     let gr = make_edge_iterator_graph::<Undirected>();  in test_edge_iterators_undir()  localVariable
1442     let mut gr = Graph::<_, _>::new();  in toposort_generic()  localVariable
1526     let mut gr = Graph::<_, _>::new();  in test_has_path()  localVariable
1625     let gr =  in from_edges()  localVariable
1638     let mut gr = Graph::<i32, i32, Undirected>::from_edges(&[  in retain()  localVariable
1688     let mut gr = Graph::<_, ()>::new();  in neighbors_selfloops()  localVariable
1737     let mut gr: Graph<_, (), _> = Graph::new_undirected();  in neighbors_selfloops()  localVariable
1780     let mut gr = Graph::<usize, (), Undirected>::from_edges(&[  in degree_sequence()  localVariable
1799     let mut gr = GraphMap::<_, (), Undirected>::from_edges(&[  in degree_sequence()  localVariable
1818     let mut gr = Graph::new();  in neighbor_order()  localVariable
1848     let mut gr = Graph::new();  in dot()  localVariable
2039     let gr: Graph<(), ()> = Graph::from_edges(&[  in dfs_visit()  localVariable
2140     let mut gr: Graph<(), ()> =  in filtered_post_order()  localVariable
2239     let gr = UnGraph::<(), _>::from_edges(&[  in test_edge_filtered()  localVariable