kandi X-RAY | fapra-osm-routing Summary
kandi X-RAY | fapra-osm-routing Summary
fapra-osm-routing is a Java library. fapra-osm-routing has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.
This is a project developed for a course offered by university of Stuttgart. The task was to implement an efficient routing algorithm on a grid graph. This graph was to be created based on OpenStreetMap data. Overall, some applications contained in this project require a large amount of memory at runtime. Due to this, it may be necessary to increase the amount of memory available to the application using the Java JVM option "-Xmx".
This is a project developed for a course offered by university of Stuttgart. The task was to implement an efficient routing algorithm on a grid graph. This graph was to be created based on OpenStreetMap data. Overall, some applications contained in this project require a large amount of memory at runtime. Due to this, it may be necessary to increase the amount of memory available to the application using the Java JVM option "-Xmx".
Support
Quality
Security
License
Reuse
Support
fapra-osm-routing has a low active ecosystem.
It has 0 star(s) with 0 fork(s). There are 1 watchers for this library.
It had no major release in the last 6 months.
fapra-osm-routing has no issues reported. There are no pull requests.
It has a neutral sentiment in the developer community.
The latest version of fapra-osm-routing is current.
Quality
fapra-osm-routing has no bugs reported.
Security
fapra-osm-routing has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
License
fapra-osm-routing does not have a standard license declared.
Check the repository for any license declaration and review the terms closely.
Without a license, all rights are reserved, and you cannot use the library in your applications.
Reuse
fapra-osm-routing releases are not available. You will need to build from source code and install.
Build file is available. You can build the component from source.
Installation instructions, examples and code snippets are available.
Top functions reviewed by kandi - BETA
kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of fapra-osm-routing
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of fapra-osm-routing
fapra-osm-routing Key Features
No Key Features are available at this moment for fapra-osm-routing.
fapra-osm-routing Examples and Code Snippets
No Code Snippets are available at this moment for fapra-osm-routing.
Community Discussions
No Community Discussions are available at this moment for fapra-osm-routing.Refer to stack overflow page for discussions.
Community Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
No vulnerabilities reported
Install fapra-osm-routing
First place a .fmi file containing the dijkstra grid graph in the src/main/resources directory called exported_grid.fmi. If instead of the dijkstra router, the hub label router should be used, insert the file with the name hub_label_data, which was generated by the LabelCreator. After this, execute the following commands:. Finally, open browser and access the url "http://localhost:8080/".
USE_HUB_LABEL_ROUTER: true if the hub label router should be used. If set to false the dijkstra router will be used instead.
IS_TEST_RUN: true if a test run should be performed. In this case, the normal application will not be started. Instead, a number of random routes will be calculated. The results of these calculations will be printed to the console.
IGNORE_RES_NO_ROUTE: If a test run is performed, it is possible to ignore the calculation times of routing requests for which both points were on water but no route could be found. If this parameter is set to true, this will be done. Otherwise these times will be considered when calculating the average calculating time.
TEST_NUM_OF_ROUTES: The number of random routes which should be generated in a test run. Note that not all of these will necessarily be a valid routing request. As some random points may be on land, the total number of routes calculated will be lower than this number.
USE_HUB_LABEL_ROUTER: true if the hub label router should be used. If set to false the dijkstra router will be used instead.
IS_TEST_RUN: true if a test run should be performed. In this case, the normal application will not be started. Instead, a number of random routes will be calculated. The results of these calculations will be printed to the console.
IGNORE_RES_NO_ROUTE: If a test run is performed, it is possible to ignore the calculation times of routing requests for which both points were on water but no route could be found. If this parameter is set to true, this will be done. Otherwise these times will be considered when calculating the average calculating time.
TEST_NUM_OF_ROUTES: The number of random routes which should be generated in a test run. Note that not all of these will necessarily be a valid routing request. As some random points may be on land, the total number of routes calculated will be lower than this number.
Support
For any new features, suggestions and bugs create an issue on GitHub.
If you have any questions check and ask questions on community page Stack Overflow .
Find more information at:
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page