Lines Matching refs:get_num_nodes

73     let mut calc = PathCalculator::new(fast_graph.get_num_nodes());  in calc_path()
81     PathCalculator::new(fast_graph.get_num_nodes())  in create_calculator()
146         let mut dijkstra = Dijkstra::new(input_graph.get_num_nodes());  in run_test_on_random_graph()
148         let mut fw = FloydWarshall::new(input_graph.get_num_nodes());  in run_test_on_random_graph()
153             let source = rng.gen_range(0, input_graph.get_num_nodes());  in run_test_on_random_graph()
154             let target = rng.gen_range(0, input_graph.get_num_nodes());  in run_test_on_random_graph()
204         assert_eq!(fast_graph.get_num_nodes(), loaded.get_num_nodes());  in save_to_and_load_from_disk()
220         assert_eq!(fast_graph.get_num_nodes(), loaded.get_num_nodes());  in save_to_and_load_from_disk_32()
304         let mut path_calculator = PathCalculator::new(fast_graph.get_num_nodes());  in run_performance_test_dist_fixed_ordering()
307             input_graph.get_num_nodes(),  in run_performance_test_dist_fixed_ordering()
325         let mut path_calculator = PathCalculator::new(fast_graph.get_num_nodes());  in run_performance_test()
328             input_graph.get_num_nodes(),  in run_performance_test()
337             fast_graph.get_num_nodes()  in print_fast_graph_stats()
359             input_graph.get_num_nodes()  in prepare_algo()