In graph G switching centers represented by vertices and edges represent communication lines between two switching centers. The edges are marked by their bandwidth, that is, the maximum speed, in bits per second, that information can be transmitted along that communication line. The bandwidth of a path in G is the bandwidth of its lowest-bandwidth edge. Please create a program in JAVA for finding a maximum spanning tree in G, which would maximize the bandwidth between two switching centers. The program's inputs are n (switching centers number) and e (bandwidths/edges number), both are integers. Switching centers should characters value( A,B etc.) Following the e lines containing bandwidth information, which includes the switching centers and integer values of their respective bandwidths/weights, the idea is to identify the two switching centers between which the maximum bandwidth is to be determined. Program should first prompt user to enter n and e values, then source switching center to destination switching center with given weight/bandwidth (example A --> B 5, B --> C 1 etc)
In graph G switching centers represented by vertices and edges represent communication lines between two switching centers. The edges are marked by their bandwidth, that is, the maximum speed, in bits per second, that information can be transmitted along that communication line. The bandwidth of a path in G is the bandwidth of its lowest-bandwidth edge. Please create a
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
