Write the Link state routing algorithm and apply to the following graph with source node is 'À'.

5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3).  Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their DVs.  Following this recomputation, to which nodes will h send its new distance vector?  (Note: to answer this question, you’ll need to know some of the DV entries at g and h at t=0, but hopefully they’ll be obvious by inspection).

How to access highest degree node using python in networkx.  Create a subgraph using ego adn write a python code

Mark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.