Replacement of the for loop for repeating the random walk #2
Description
We can initiate the random walk by having numWalks number of walkers per vertex and run the random walk once for all. This will reduce the overhead of applying union for appending paths to the total path.