0

Hi it would be great help if anybody can guide me through this Question

Problem: Find the least cost path between two nodes in a graph.

The input for building the node graph for the problem will be in the format as below.

Enter Nodes and Weight (Q to terminate):

: AB 2

: AC 5

: AD 10

: AE 11

: BC 12

: BD 14

: CE 16