Looks pretty nice. Maybe add an colour for showing which cell is currently being searched?
@manngo676
6 жыл бұрын
IQuick 143 good idea.
@aandersaa
4 жыл бұрын
There is a bug when using Dijkstra if start and finish is on the same vertical center line.
@alexma2984
3 жыл бұрын
why is you Dijkstra’s Algorithm run faster than A *?
@GreerViau
3 жыл бұрын
It doesn't, A* is faster, but there's a slider to adjust the amount of delay between checking cells
@agility6961
4 жыл бұрын
I'm not sure if anyone has pointed this out to you but your sort and path finding projects seem near identical to a youtuber called Clément Mihailescu in his video "The Projects That Got Me Into Google (tips for software engineering projects)". Not sure if he intentionally copied these from you but, it seems odd that he would use those exact two projects so similarly.
@wesmoto2550
4 жыл бұрын
they are very popular algorithms that you learn in computer science. Its a really common project idea
@HarshPatel-iy5qe
4 жыл бұрын
Bruh I know I also watched his video, But this is very comman idea just search on google you will het tones of tutorial also ...how to make... It's not copied ..👍
@HarshPatel-iy5qe
4 жыл бұрын
By the way bro this guy posted a video 2 years ago and Clement Post few months ago ...... So logically no body copied no body
@w1d3r75
3 жыл бұрын
Everyone can make one. The logic behind the code is completely different, specially in java swing ;)
@vinaypandey9172
4 жыл бұрын
Please make tutorial
@cyberwaldemar
4 жыл бұрын
U simply make a graph and use one of pathfinding algorithms
@captainvenom7252
Жыл бұрын
I'm trying to understand dijkstra's algorithm but guess have to give a step up to A* algorithm
Пікірлер: 18