https://github.com/disconnect3d/rmi_dijkstra
https://github.com/disconnect3d/rmi_dijkstra
dijkstra dijkstra-algorithm dijkstra-shortest-path java java-rmi rmi rmi-dijkstra
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/disconnect3d/rmi_dijkstra
- Owner: disconnect3d
- Created: 2016-06-12T09:39:08.000Z (almost 9 years ago)
- Default Branch: master
- Last Pushed: 2016-06-12T23:49:00.000Z (almost 9 years ago)
- Last Synced: 2025-02-14T16:24:55.137Z (3 months ago)
- Topics: dijkstra, dijkstra-algorithm, dijkstra-shortest-path, java, java-rmi, rmi, rmi-dijkstra
- Language: Java
- Size: 1.06 MB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Java RMI Dijkstra's graph search algorithm
Yet another Dijkstra graph search algorithm implemented using Java RMI to distribute work that can be parallelized...
Written for parallel and distributed systems course on AGH University of Science and Technology.
**NOTE:** This is just an university project. Probably some of its parts could have been done better. Don't be scared of commits messages, I didn't do any git cleanup (e.g. `git rebase`) in here as this won't be maintained anymore.
In current state, the workload can't be distributed to different machines. It is easy to fix that - just change the `Client` and `DijkstraClient` classes to support it (btw. those classes could have had a better name).
# Running
To compile everything just fire `make`.
To run server fire:
```
make runserver REGISTRY_IP=127.0.0.1 PORTS="9991 9992 9993"
```
To run client fire:
```
make runclient REGISTRY_IP=127.0.0.1 PORTS="9991 9992 9993" TESTCASE=1
```
Of course you can set proper parameters (`REGISTY_IP`, `PORTS` and `TESTCASE`).
# Directories
* **Client** - contains client implementation
* **Server** - contains server implementation
* **Shared** - contains stuff that is shared in Client & Server
* **testcases** - contains map examples