Loading repository data…
cdaou / repository
With the development of technology and the evolution of societies, more and more people are using a passenger car, which, combined with the urbanization of the modern times, results in traffic congestion and long delay in passenger movement, especially in large urban centers. Thus, in the context of Intelligent Transport Systems (ITS) and aiming at traffic decongestion, in this diploma thesis a Java and JavaScript application has been developed, that implement network routing algorithms in transport networks to find the shortest route. More specifically, the communication technologies used in ITS, network routing algorithms and protocols were studied and the Dijkstra and Bellman-Ford algorithms were used to develop the application. The algorithms are applied to a graph representing a part of the road network, that is roads are considered as the links and lanterns as the nodes of the graph and the weight of the links indicates the traffic factor that has a road at that moment. The user can select the initial node in which is located, and the system calculates and displays the shortest path to certain specific destinations (e.g. airport, bus station, central points, etc.) defined by the administrator.
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
This is a solution to the shortest route problem, using network routing algorithms in transport networks.
With the development of technology and the evolution of societies, more and more people are using a passenger car, which, combined with the urbanization of the modern times, results in traffic congestion and long delay in passenger movement, especially in large urban centers. Thus, in the context of Intelligent Transport Systems (ITS) and aiming at traffic decongestion, in this project a Java and JavaScript application has been developed, that implement network routing algorithms in transport networks to find the shortest route. More specifically, the communication technologies used in ITS, network routing algorithms and protocols were studied and the (centralized) Dijkstra and (distributed) Bellman-Ford algorithms were used to develop the application. The algorithms are applied to a graph representing a part of the road network, that is roads are considered as the links and lanterns as the nodes of the graph and the weight of the links indicates the traffic factor that has a road at that moment. The user can select the initial node in which is located, and the system calculates and displays the shortest path to certain specific destinations (e.g. airport, bus station, central points, etc.) defined by the administrator. Βoth projects were implemented for the area of the center of Thessaloniki.
This implementation is more useful to the system administrator. In this case the map is static and shows a specific area, which has been pre-selected by the program. Τhe nodes are inserted by the administrator in the connection and coordinate files. The advantage of this application is that the administrator can very easily edit the graph and perform tests.
Go to Help > Go to Eclipse MarketPlace > Search e(fx)clipse > Install it. Then, to add it on the project just follow: Java Build Path > Libraries > Add Libraries > JavaFx SDKSelected from shared topics, language and repository description—not editorial ratings.
organicmaps /
🍃 Organic Maps is a free Android & iOS offline maps app for more than 6M travelers, tourists, hikers, and cyclists. It uses crowd-sourced OpenStreetMap data and is developed with love by the community. No ads, no tracking, no data collection, no crapware. Please donate to support the development!
74/100 healthcheckstyle /
Checkstyle is a development tool to help programmers write Java code that adheres to a coding standard. By default it supports the Google Java Style Guide and Sun Code Conventions, but is highly configurable. It can be invoked with an ANT task and a command line program.
88/100 health
This implementation is more useful to the user. In this case the map is dynamic, which means that the user can drag it (and/or zoom) to any area. The pins which represent the nodes have been manually added by the user (only for the area of Thessaloniki) to the data.js file, where the coordinates of the traffic lights and the connections are stored in JSON form. The advantage of this application is that is very user-friendly and is essentially the end product, which will be used by the user.
JavaFX - https://openjfx.io/
Apache Commons Logging - http://commons.apache.org/proper/commons-logging/download_logging.cgi
jxmapviewer2 - https://github.com/msteiger/jxmapviewer2
Apache Tomcat - http://tomcat.apache.org/
Leaflet - https://leafletjs.com/
Mapbox - https://www.mapbox.com/
Copyright 2019 Christos Daoulas
Licensed under the Apache License, Version 2.0 (the "License");
Υou may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
Tencent /
Tencent Kona is a no-cost, production-ready distribution of the Open Java Development Kit (OpenJDK), Long-term support(LTS) with quarterly updates. Tencent Kona serves as the default JDK internally at Tencent Cloud for cloud computing and other Java applications.
70/100 healthlwjglgamedev /
Source code of the chapters of the book 3D Game Development with LWJGL 3
84/100 healthluontola /
Exercise for learning Test-Driven Development with the help of predefined tests
67/100 healthsPredictorX1708 /
Java programming. All in one Java Resource for learning. Updated every day and up to date. All Algorithms and DS along with Development in Java. Beginner to Advanced. Join the Discord link.
74/100 health