Shortest Path in Matrix
$10-30 USD
Dibayar saat pengiriman
Hello,
I've a binary matrix containing the values 0 (black) and 255 (white). Based on a given start point, I need to find the shortest path to the last white (255) point in matrix (last column).
I've tried to implement the BFS algorithm, as you can see on my code, but have a deep memory leak bug. One solution is use Dijsktra Algorithm, but I don't know how to implement without using Graphs.
The binarization algorithm are already working, and it's possible that can be holes in the white line, so, if you can fix that, it's a plus.
Sadly, I need it today.
The code it's above, take a look before proposals please.
ID Proyek: #8078427
Tentang proyek
Diberikan kepada:
Hello, I am a Software Engineer and a competitive programmer and I have been using C++ for all my projects and coding contests. I currently rank 379 out of almost 38000 competitive programmers. Link to check Lebih banyak
5 freelancer rata-rata menawar $31 untuk pekerjaan ini
Hi, I have strong background in Algorithms and experience in Programming. Let me help you. I am ready to start.
hi... i can do this. Please let me know to start immediately. i can deliver you on time. Please initiate communication to discuss further. thanks
Hi! I can write this program for you today. I have some basic algorithm knowledge and of course I can write Dijkstra algorithm.
I will need your code. And a few hours to complete it. If you have a requirement document which details what exactly has to be done, its a plus. Feel free to contact me before accepting the bid, if u want to.
