intial tests

evrouting/charge/__init__.py

+from .routing import shortest_path
\ No newline at end of file

evrouting/charge/routing.py

+import networkx as nx
+
+
+def shortest_path(G: nx.Graph, s, t, b_0: float, b_t: float, U: float):
+    """
+    Calculates shortest path using the CHarge algorithm.
+
+    :param G: Input Graph
+    :param s: Start Node identifier
+    :param t: End Node identifier
+    :param b_0: Start SoC
+    :param b_t: End SoC
+    :param U: Capacity
+    :return:
+    """
+    pass

evrouting/gasstation/__init__.py

+from .routing import shortest_path
\ No newline at end of file

evrouting/gasstation/routing.py

+import networkx as nx
+
+
+def shortest_path(G: nx.Graph, s, t, b_0: float, b_t: float, U: float):
+    """
+    Calculates shortest path using a generalized gas station algorithm.
+
+    :param G: Input Graph
+    :param s: Start Node identifier
+    :param t: End Node identifier
+    :param b_0: Start SoC
+    :param b_t: End SoC
+    :param U: Capacity
+    :return:
+    """
+    pass

tests/config.py

@@ -9,6 +9,8 @@ edge_case = {
     'b_0': 0,
     'b_t': 0,
     'U': 4,
+    's': 0,
+    't': 2,
     'nodes': [
         Node('s', charging_coeff=1),
         Node('a', charging_coeff=2),