weighted graphs weighted graph adds bit of extra information to the edges this can be numerical value that indicates something let' sayfor examplethat the following graph indicates different ways to get from point to point you can either go straight from to dor choose to pass through and associated with each edge is the amount of time in minutes the journey to the next node will takeperhaps the journey ad would require you to ride bike (or walkb and might represent bus stops at you would have to change to different bus finallycd may be short walk to reach in this examplead and abcd represent two different paths path is simply sequence of edges that you pass through between two nodes following these pathsyou see that the total journey ad takes minuteswhereas the journey abcd takes minutes if your only concern is timeyou would be better off traveling along abcdeven with the added inconvenience of changing buses the fact that edges can be directed and may hold other informationsuch as time taken or whatever other value the move along path is associated withindicates something interesting in previous data structures that we have worked withthe lines we have drawn between nodes have simply been connectors even when they had arrows pointing from node to anotherthat was easy to represent in the node class by using next or previousparent or child with graphsit makes sense to see edges as objects just as much as nodes just like nodesedges can contain extra information that is necessary to follow particular path