Lines Matching refs:N
82 std::size_t N = 1000; // number of vertices variable
84 std::size_t dst = N - 1; // end of path
170 if (at == N) in make_path()
215 vertices.resize(N); in InitializeGraph()
216 edges.resize(N); in InitializeGraph()
217 predecessor.resize(N); in InitializeGraph()
218 g_distance.resize(N); in InitializeGraph()
219 f_distance.resize(N); in InitializeGraph()
220 locks = new oneapi::tbb::spin_mutex[N]; in InitializeGraph()
225 oneapi::tbb::blocked_range<std::size_t>(0, N, 64), in InitializeGraph()
237 oneapi::tbb::blocked_range<std::size_t>(0, N, 64), in InitializeGraph()
249 for (std::size_t i = 0; i < N; ++i) { in InitializeGraph()
266 oneapi::tbb::parallel_for(oneapi::tbb::blocked_range<std::size_t>(0, N), in ResetGraph()
270 predecessor[i] = N; in ResetGraph()
285 .arg(N, "N", " number of vertices") in main()
293 (int)N, in main()
299 if (dst >= N) { in main()
303 (int)N, in main()
304 (int)N - 1); in main()
305 dst = N - 1; in main()
309 max_spawn = N / grainsize; in main()
319 if (predecessor[dst] != N) { in main()