Path Finding - Java

Github Repo: github.com/greerviau/Path-Fin...

[@kobach3000]

Класс! Очень круто! This is cool, man!

[@yashin2068]

Thank u really :) best wishes...

[@snailcat8767]

Thank you so much.

[@aandersaa]

There is a bug when using Dijkstra if start and finish is on the same vertical center line.

[@abderrahmaneisntthatenough6905]

Wow i m inspired

[@blanco0379]

Dens: *51%*
My eyes: bleed

[@IQuick143cz]

Looks pretty nice.
Maybe add an colour for showing which cell is currently being searched?

[@manngo676]

IQuick 143 good idea.

[@alexma2984]

why is you Dijkstra’s Algorithm run faster than A *?

[@GreerViau]

It doesn't, A* is faster, but there's a slider to adjust the amount of delay between checking cells

[@vinaypandey9172]

Please make tutorial

[@cyberwaldemar]

U simply make a graph and use one of pathfinding algorithms

[@agility6961]

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]

they are very popular algorithms that you learn in computer science. Its a really common project idea

[@HarshPatel-iy5qe]

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]

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]

Everyone can make one. The logic behind the code is completely different, specially in java swing ;)

[@captainvenom7252]

I'm trying to understand dijkstra's algorithm but guess have to give a step up to A* algorithm