Question

1. Given the graph below, compute the rank of nodes A, B, and C by setting up the flow equations with the constraint that the sum of ranks is 1, and then solving the equations for the rank values. Make sure to show/explain the steps.

$clip_image001_0003.png$

Answer 1

Graph is an abstract data structure that represents set objects and their relationship as vertices and edges.

Objects in the node is : {A,B,C}

Edges {(A,C),(B,C),(B,A),}

The edges and travelling paths are:

B -> A

C -> B

C -> A

A -> C

Here if we observe A to and C to A are vice versa path clearly we say this is the weighted path in this graph.

A : has path from B as well from C and travel to C

B: has path from C and travel to A

C: has path from A and travel to B and A

Here the weighted node is A because two are travelling towards A means (B,A) and (C,A).

After C has towards (A,c)(B,c) and (C,A).

B has only one forward and toward form A and C.

A C and B of ranks of the given nodes as per the graph.