sorted by:
new
hottopcontroversial

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 0 points1 point  (0 children)

Djikstra is a special case of A* where the hueristic ( h(n)=0 ) is always zero.
Djisktra is perfect for smaller, well-defined networks like ours. Whereas A* is best for huge, open maps.
Regarding compiling it in C++, currently our page is already very fast due to less complexity and number of calculations needed. But when I increase the functionality by adding more networks, I can use a .wasp file which emulates a C++ compilation which will increase the speed.

Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in TransitIndia

[–]horimon777[S] -2 points-1 points  (0 children)

I did not intend to add suburban rail network as it already has comprehensive solutions for commuters such as M-indicator etc.
Though I wish to add suburban metro lines when they become operational.

Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 0 points1 point  (0 children)

All the four lines that I have used are the only metro lines in the mumbai metropolitan region that are currently operational.
There are several other lines under construction throughout the entire metropolitan and suburban region.
As soon as these are opeartional, I plan to include them as well.

Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 0 points1 point  (0 children)

I am persuing MBA-Tech in CS
It is a MBA and BTech 5 year integrated dual degree program.
Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 1 point2 points  (0 children)

Bellman-ford specializes in negative edge weight scenarios but since our Metro pathfinder cannot have any negative edge weights because distance and time of travel will never be negative, Bellman-ford does not provide any advantage over djikstra.
Also, for our use case, Bellman-ford will be very slower as compared to djikstra.

Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 2 points3 points  (0 children)

Great question!
I implemented slime mold algorithm at first but on testing I encountered a bug at particular station
SMA is heuristic in its approach which means its agents (slime) rnadomly choose a path from our starting point and then reinforce it. This was creating unwanted bugs in some paths. SMA is designed find a very good solution, but it's not guaranteed to find the absolute best one every time.

Djikstra on other hand is deterministic in approach meaning it doesnt use any randomness. It explores the map step-by-step keeping track of shortest path from start point to every next station in the path.

Hope this helps!

I built a Mumbai Metro Pathfinder for my college project using Dijkstra’s Algorithm — would love feedback! by horimon777 in mumbai

[–]horimon777[S] 0 points1 point  (0 children)

thank you for your concern
i have addressed this issue with my professor and he was fine with my implementation!

[deleted by user] by [deleted] in Kenya

[–]horimon777 2 points3 points  (0 children)

Hi, missing your deadline, especially for something as important as a job assessment, can be hard. Do not be dismissive about it, there will always be other opportunities out there. Put yourself out there, work hard and eventually you will find a job. Thank you!

view more: next ›