main.py
def findSolution(a, b, goal_amount):
    """ Creates a graph, uses bfs to find distance, and then returns the
    shortest path to a goal_amount as a list. """
    if validJug(a, b, goal_amount):
        g = buildGraph(a, b)
        bfs(g)
    else:
        return 'This scenario is not possible'
    return path2root(g, goal_amount)
 Creates a graph, uses bfs to find distance, and then returns the
    shortest path to a goal_amount as a list. 
Creates a graph, uses bfs to find distance, and then returns the
shortest path to a goal_amount as a list.
Creates a graph uses bfs to find distance and then returns the shortest path to a goal_amount as a list .
def findSolution(a, b, goal_amount):
    if validJug(a, b, goal_amount):
        g = buildGraph(a, b)
        bfs(g)
    else:
        return 'This scenario is not possible'
    return path2root(g, goal_amount)
def findSolution ( a , b , goal_amount ) : if validJug ( a , b , goal_amount ) : g = buildGraph ( a , b ) bfs ( g ) else : return 'This scenario is not possible' return path2root ( g , goal_amount )
Creates a graph, uses bfs to find distance, and then returns the
shortest path to a goal_amount as a list.
Creates a graph uses bfs to find distance and then returns the shortest path to a goal_amount as a list .
""" Creates a graph, uses bfs to find distance, and then returns the
    shortest path to a goal_amount as a list. """
a
b
goal_amount