Find Shortest path between cities without duplicate calculation.(Network simplification for huge data and considered T, F, B roads.)

€8-30 EUR

Në vazhdim

Postuar

about 3 years ago

€8-30 EUR

Paguhet në dorëzim

I am looking alternative to get a generalized network like, I want to simplify my network (to be able to, sort of, avoid unnecessary calculations) is based on a shortest path calculation as well, and for it to be the shortest path connecting each pair. Basically i am not looking for the the algorithm for find the shortest path. My main idea is how i can simplify my network data which is huge like whole country like Germany and how i can find the path without duplicate calculation. I suggest to calculate the Arial net distance for given point but i don't have much idea about it

PostgreSQL

Python

SQL

ID e Projektit: 29038686

Rreth projektit

1 propozim

Projekt në distancë

Aktive 3 yrs ago

Po kërkoni të fitoni para?

Adresa e email-it

Përfitimet e ofertës për Freelancer

Vendosni buxhetin dhe afatin tuaj

Paguhuni për punën tuaj

Përshkruani propozimin tuaj

Është falas të regjistrohesh dhe të bësh oferta për punë

1 freelancer is bidding on average €30 EUR for this job

@gsingh1997

Hi! I am very well experienced with Graph Algorithms through a degree in Computer Science (from IIT Kanpur, gpa - 9.3). I do not 100% understand your problem statement but I would like to discuss it further with you. From what I understand about the problem statement, it does not seem impossibly difficult. Based on our discussion, I can let you know exactly how long it will take for me to complete it. Let me know if you are interested. Looking forward to hearing from you.

€30 EUR në 3 ditë