Database Driven Shortest Path finder.

de către urmate

JavaFX, Mysql based database driven application that can manage unlimited number of Data sets to be used to find the shortest path and shortest distance. The application can export the path and distance to feed it into another larger application. Datasets are stored into the database with the dataset name used as a table inside the database, it is dynamically created. The application loads all the datasets from database at startup to be select to calculate paths. Dijkstra algorithm is used for finding the path and minimum distance.

image of username urmate Flag of Pakistan Lahore, Pakistan

Despre mine

▼ Desktop Applications → Java, JavaFX, Swing → C/C++, QT, Visual C++ → C# → Vb.Net → Python, Tkinter, PyQT → Dart ▼ Mobile Programming → Android → Java → Kotlin → Flutter ▼ Web Programming → Java, JSP, Servlets, EJB, JSF → Asp.Net, MVC, Entity Framework → PHP Core, Laravel → Ajax, Bootstrap → Web Services: Restful, Soap → HTML, XHTML, XML, DTD, XSD, Json ▼ JavaScript → Node → Express → Socket IO → AngularJS → jQuery ▼ Database → MySql → Oracle → MSSQL → HBase → JavaDB → PostgreSQL → MS Access → Cassandra → MongoDB → JPA → Hibernate ▼ Misc → Algorithms → Data Structures → Charting: Plotly, D3, Google Charts, JFreeCharts → UML Diagrams → Files: PDFBox, IText, POI, Excel → Testing: Junit, TestNg, unittest

$50 USD/oră

676 păreri