Hey, this is kidist ,
I want to run the algorithms on the large grid size and the obstacle probability is 1/n .So, does it mean the number of obstacles will decrease as we increase the grid size n ?
Thank you !
Hey, I saw your code it is an excellent implementation. I have a question on what kind of graph/grid you applied. is it visibility graph,Sukharev grid?
Thank you