Bumped up the versions of all pre-commit hooks (#6)

* Bumped pre-commit hooks versions

* Linting

Author: hasnainroopawalla

.pre-commit-config.yaml

@@ -1,12 +1,13 @@
 repos:
 - repo: https://github.com/ambv/black
-  rev: 19.3b0
+  rev: 22.6.0
   hooks:
-  - id:  black
+  - id: black
 - repo: https://github.com/pre-commit/pre-commit-hooks
-  rev: v4.0.1
+  rev: v4.3.0
   hooks:
   - id: check-yaml
+  - id: check-toml
   - id: check-ast
   - id: end-of-file-fixer
   - id: trailing-whitespace
@@ -15,7 +16,7 @@ repos:
     args:
     - --maxkb=1000
 - repo: https://github.com/Lucas-C/pre-commit-hooks
-  rev: v1.1.10
+  rev: v1.3.0
   hooks:
     -   id: remove-crlf
     -   id: remove-tabs

README.md

@@ -121,8 +121,8 @@ Simulator(graph).simulate(source, destination, num_episodes=100, plot=True)
 
 <hr>
 
-## Contributing
 
+## Contributing
 
 - Post any issues and suggestions on the GitHub [issues](https://github.com/hasnainroopawalla/Ant-Colony-Optimization/issues) page.
 - To contribute, fork the project and then create a pull request back to master.

aco_routing/utils/ant.py

@@ -75,7 +75,7 @@ def _calculate_edges_total(
         """
         total = 0.0
         for neighbor, edge in unvisited_neighbors.items():
-            total += (edge.pheromones ** alpha) * ((1 / edge.travel_time) ** beta)
+            total += (edge.pheromones**alpha) * ((1 / edge.travel_time) ** beta)
         return total
 
     @staticmethod
@@ -96,7 +96,7 @@ def _calculate_edge_probabilites(
         probabilities = {}
         for neighbor, edge in unvisited_neighbors.items():
             probabilities[neighbor] = (
-                (edge.pheromones ** alpha) * ((1 / edge.travel_time) ** beta)
+                (edge.pheromones**alpha) * ((1 / edge.travel_time) ** beta)
             ) / total
         return probabilities
 
@@ -157,8 +157,7 @@ def _pick_next_node(
         return self._choose_neighbor_using_roulette_wheel(sorted_probabilities)
 
     def take_step(self) -> None:
-        """This method allows the ant to travel to a neighbor of the current node in the graph.
-        """
+        """This method allows the ant to travel to a neighbor of the current node in the graph."""
         # Mark the node as visited.
         self.visited_nodes.add(self.current_node)
 

aco_routing/utils/graph.py

@@ -212,8 +212,7 @@ def compute_path_travel_time(self, path: List[str]) -> float:
         return cost
 
     def evaporate(self) -> None:
-        """Evaporates the pheromone values of all the edges given the evaporation parameter (rho).
-        """
+        """Evaporates the pheromone values of all the edges given the evaporation parameter (rho)."""
         for node_id, node in self.graph.items():
             for neighbor, edge in self.graph[node_id].edges.items():
                 edge.pheromones = (1 - self.evaporation_rate) * edge.pheromones

aco_routing/utils/simulator.py

@@ -33,8 +33,7 @@ class Simulator:
     episodes: List[Episode] = field(default_factory=list)
 
     def show_simulation_plot(self) -> None:
-        """Displays a plot to compare the path costs of the candidate algorithm with the baseline Dijkstra's algorithm across all episodes.
-        """
+        """Displays a plot to compare the path costs of the candidate algorithm with the baseline Dijkstra's algorithm across all episodes."""
         dijkstra_costs, aco_costs = [], []
         for episode in self.episodes:
             dijkstra_costs.append(episode.dijkstra_cost)

setup.py

@@ -8,7 +8,7 @@
 
 setup(
     name="aco_routing",
-    version="1.0.3",
+    version="1.0.4",
     packages=find_packages(exclude="tests"),
     description="A Python package to find the shortest path in a graph using Ant Colony Optimization (ACO).",
     long_description=long_description,