计算机科学作业代做 Computer Science 320SC

Computer Science 320SC – (2022)

计算机科学作业代做 Note that two paths are allowed to go through the same node, such as node 7. No other pair of nodes has a higher congestion level.

Congested Networks (part 1) 计算机科学作业代做

Given a connected computer network (bidirectional communication) we want to fifind two difffferent nodes u and v such that we can maximize the congestion between u and v with a continuously sent virus being sent between the pair.

We defifine the congestion level as the maximum number of edge-disjoint paths between nodes u and v. For example, the network shown in the following fifigure has three difffferent paths between nodes 0 and 6 such that each edge is only part of one of the paths. Note that two paths are allowed to go through the same node, such as node 7. No other pair of nodes has a higher congestion level.

We have two test cases (easy and harder) for marking on the automarker, worth 1 and 2 marks, respectively 计算机科学作业代做

Input Specifification

We will be given a sequence of connected computer networks each with n nodes, n ≤ 40, labeled {0, 1, . . . , n − 1}. The last input case will be followed by a network of n = 0 nodes, which should not be processed.

The specifification for a computer network will be as follows: the fifirst line contains a single non-negative value n, denoting the number of nodes. This is then followed by n lines of integers, separated by spaces, denoting the neighbors (zero indexed) of each node. Expect up to 2000 test cases.

Output Specifification 计算机科学作业代做

For each input case output one integer on a line by itself denoting the maximum congestion level possible for some pair of its network nodes.

Congested Networks (part 2) 计算机科学作业代做

We extend the problem of the previous section to the case were we want to count only vertex-disjoint  paths as a measure of congestion. For this case, the two paths through node 7 of the previous example are not allowed. However, there does exist another pair of nodes (e.g. 6 and 7) that do have three vertex-disjoint paths between them. The input and output specififications are the same as before. This problem will have two test cases on the automarker: an easy set with unlimited submissions allowed (0 marks) and a harder set (2 marks).

更多代写：cs代写   经济代考   会计代写      计算机科学代写 东南浸信会神学院代写