You can use DFS or BFS for this prob

Write Python code for the below problem: Find all paths between 2 nodes Example start node A and goal node E nodes will be input by user) and find the path cost of every path between every node of graph to the goal node i.e for example E node and take Avg(cost) of those paths and store in array like H[A]=20..Avg path cost from A to E H[B]=30...Avg path cost from B to E H[C]=80...Avg Path cost from C to E H[D]=80...Avg Path cost from D to E Go on till the goal node. For goal node give the value as zero. .H[E]=0 as this is the goal node. The code should be able to take the start and end nodes as inputs