The goal of this project is to determine the minimum number of charging points for an urban community. The project follows these following rules
- A city must have or connected with a city who have a charging point.
- The number of charging points try to be the lowest possible (our algorithm uses a heuristic)
- Resolve manually
- Resolve automatically with a heuristic
- Load urban community from a file (add the path to the file in the command line arguments)
- Save urban community in a file
- OpenJDK 17
- GraphViz (optional, for display the urban community)
The main method is in the class App.
- Get the source code on your machine
- Clear the
bin
directory if needed withrm -rf bin
- Build sources files with
javac -d bin --source-path src src/App.java
- Run the project with
java -cp bin App
- Follow the step in the previous part.
- Create the jar file with
jar --create --file project_paa.jar --main-class App -C bin/ .
. - Run the jar with
java -jar project_paa.jar
.
- Generate the javadoc with
javadoc -d doc --source-path src core exceptions graph ui
. - Open
index.html
in the doc directory.