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