Skip to content
Branch: trunk
Clone or download
Pull request Compare This branch is even with pohlinkzei:trunk.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.circleci
.github
Toolchain
cmake
contrib
gradle
man
navit
po
scripts
.gitchangelog.rc
.gitchangelog.tpl
.gitignore
.mailmap
AUTHORS
CHANGELOG.md
CMakeLists.txt
CONTRIBUTING.md
COPYING
COPYRIGHT
GPL-2
LGPL-2
README.md
build.gradle
checkstyle.xml
config.h.cmake
cpack.cmake
gradlew
gradlew.bat
settings.gradle

README.md

Build Status CodeFactor

Navit on Android tablet:

navit on android

Navit on Linux based Carputer:

navit-nuc-osd

NavIT

Navit is a open source (GPL) car navigation system with routing engine.

It's modular design is capable of using vector maps of various formats for routing and rendering of the displayed map. It's even possible to use multiple maps at a time.

The GTK+ or SDL user interfaces are designed to work well with touch screen displays. Points of Interest of various formats are displayed on the map.

The current vehicle position is either read from gpsd or directly from NMEA GPS sensors.

The routing engine not only calculates an optimal route to your destination, but also generates directions and even speaks to you.

Navit currently speaks over 70 languages!

You can help translating via our web based translation page: http://translations.launchpad.net/navit/trunk/+pots/navit

For help or more information, please refer to the wiki: http://wiki.navit-project.org

If you don't know where to start, we recommend you to read the Interactive Help : http://wiki.navit-project.org/index.php/Interactive_help

Maps:

The best navigation system is useless without maps. Those three maps are known to work:

GPS Support:

Navit read the current vehicle position:

  • directly from a file
  • from gpsd (local or remote)
  • from udp server (friends tracking) (experimental)

Routing algorithm

NavIt uses a Dijkstra algorithm for routing. The routing starts at the destination by assigning a value to each point directly connected to destination point. The value represents the estimated time needed to pass this distance.

Now the point with the lowest value is chosen using the Fibonacci heap and a value is assigned to connected points whos are unevaluated or whos current value ist greater than the new one.

The search is repeated until the origin is found.

Once the origin is reached, all that needs to be done is to follow the points with the lowest values to the destination.

You can’t perform that action at this time.