Problem FedEx must transport packages from a central warehouse to various destinations (hubs) using a road network. Each road segment has an associated cost, representing the transportation cost per kilometer. Problem Facts 1. Central warehouse at node A, with four destinations (nodes B, C, D, and E). 2. Transportation costs per kilometer between nodes: -A to B: $5 USD -A to C: $3 USD -A to D: $8 USD -B to E: $2 USD -C to B: $2 USD -C to D: $2 USD -D to E: $4 USD Detail:  - Network representation and explanation of its construction. - Implementation details in python with networkx and results. Explanation of the differences between the implementation of the Dijkstra and Bellman-Ford algorithms. - Analysis of the shortest paths and associated costs.

Problem

FedEx must transport packages from a central warehouse to various destinations (hubs) using a road network. Each road segment has an associated cost, representing the transportation cost per kilometer.

Problem Facts

1. Central warehouse at node A, with four destinations (nodes B, C, D, and E).
2. Transportation costs per kilometer between nodes:

-A to B: $5 USD
-A to C: $3 USD
-A to D: $8 USD
-B to E: $2 USD
-C to B: $2 USD
-C to D: $2 USD
-D to E: $4 USD

Detail: 

- Network representation and explanation of its construction.
- Implementation details in python with networkx and results. Explanation of the differences between the implementation of the Dijkstra and Bellman-Ford algorithms.
- Analysis of the shortest paths and associated costs.