Add type hint to Graph.remove_pair

Author: tioBlachi

graphs/directed_and_undirected_weighted_graph.py

@@ -314,10 +314,10 @@ def add_pair(self, u, v, w=1) -> None:
             self.graph[v] = [[w, u]]
 
     # handles if the input does not exist
-    def remove_pair(self, u, v):
+    def remove_pair(self, u, v) -> None:
         """
         Removes the edge between u and v in an unidirected graph, if it exists
-        
+
         >>> g = Graph()
         >>> g.add_pair(1,2)
         >>> g.add_pair(1,3,5)