Telephone swotching graph problem
A-15.2 Suppose you are given a diagram of a telephone network, which is a graph G whose vertices represent switching centers, and whose edges represent commu- nication lines between two centers. The edges are marked by their bandwidth, that is, the maximum speed, in bits per second, that information can be transmit- ted along that communication line. The bandwidth of a path in G is the bandwidth of its lowest-bandwidth edge. Give an algorithm
OR
OR