Skip to content
This repository was archived by the owner on Jul 24, 2026. It is now read-only.

Latest commit

 

History

14 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Paris Metro Problem - Problema do Metrô de Paris

English

This work consisted of creating a script to find the fastest route between the originating station and the destination station.

In the first attempt I used Dijkstra's Algorithm but it didn't work very well...

On the second one I chose to use the search A* (A star) and it's worked :)!

This script from Wagner Filho help me a lot.

Português

Este trabalho consistiu em criar um script para encontrar o trajeto mais rápido entre a estação de origem e a estação de destino.

Na primeira tentativa eu utilizei Algoritmo de Dijkstra mas não deu muito certo...

Na segunda eu optei por usar a busca A* (A estrela) e deu tudo certo :)!

Esse script do Wagner Filho me ajudou muito.

About

Find the fastest route between the originating station and the destination station using search A*(A star)

Resources

Stars

3 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages