Developing a train guide

Question

0.00/5 (No votes)

See more:

I want to do an Application that can help find the best route possible.

Example, Taking a train from one station to another. Some stations require us switching trains.

I don't have to know the solution, How do i start this? I am not asking for solutions or easy way out.

What I have tried:

I tried googling, Came up with Travelling Sales algorithm/A* algorithm but they really look so complicated for a beginner programmer like me. I am working with C#. Any small tips will help me.

Posted 25-Dec-18 22:59pm

Member 14096158

Updated 26-Dec-18 12:38pm

Add a Solution

2 solutions

Solution 2

You already posted almost the same question: Editing a Question[^]
and accepted an answer. What is wrong in first question?

Quote:
I want to do an Application that can help find the best route possible.

You first need to define what is the best route, what makes a route better than another.

Quote:
but they really look so complicated for a beginner programmer like me.

Algorithms look complicated because they are complicated, Finding best path is a hard problem, efficient solutions are complicated. If you are really a beginner, such problem is too complicated because you lack necessary background.
It is like trying to learn to drive a car by winning a Formula 1 grand price, it don't work.
Programming have been teach to millions of people, what works and what don't is known and that is the reason teachers are teaching the way they are, it is the easy way.

My advice: put this project aside for now and learn with simpler projects, then come back to this project.

Posted 26-Dec-18 12:39pm

Patrice T

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

AnkushK1 · Accepted Answer · 2018-12-25T23:16:00

Euclidean and Manhattan distance algorithms are most commonly used approaches to solve distance problems and are relatively easier to implement. If you are into such problems for the first time then you can first start to look at distance problems online, that will help you develop understanding your problem statement better and then look for solution. Below are few references for you to start looking at.

Let me know if that helps.

Five most popular similarity measures implementation in python[^]

mathematics - Calculating distance with Euclidean, Manhattan, and Chebyshev in C# - Code Review Stack Exchange[^]

https://www.codeproject.com/questions/645917/manhattan-distance-csharp