uniform or weight graph

[khuonglm]

In the PA, it says "Specifically, you will implement a simplified version of RIPv1, one of the most popular routing protocols on the Internet. It is a distance vector routing protocol in which link cost is simply the hop count." So I think we only count the number of hops as a uniform graph, but the figures are all weight graph. Should I handle uniform or weight graph? Thank you.

[sungjoonim]

In PA4, in addition to RIPv1, Bellman-Ford algorithm is used. Therefore, you should think it as weighted graph.
Please refer to the following sentences written in the document.

The main difference between RIPv1 and the theoretical Bellman-Ford algorithm is the link cost. RIPv1 uses the hop count, while the latter allows arbitrary values.