short notes about the codes that i forgot

1. Visualisation of Label

left: nx.draw(G, with_labels=True) right: nx.draw(G, with_labels=False)

1. Generating Path Graph Path Graph: a path graph $P_n$ is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. Simply saying, in $P_n,$ all $n$ vertices lie in a straight line.

The example above is $P_2, P_3, P_4$ and $P_5$ from left to right. For $P_n$ we used code nx.path_graph(n) to generate it.

1. Page Rank

   A simple analogy to explain the page rank is surfer in the web that moves from one page to the other. Then, page rank of any page is roughly the probability that the random surfer will land on a particular page. Since more links go to the important pages, the surfer is more likely to end up there.

Reference

1. Path Graph
2. “Path Graph.” From MathWorld–A Wolfram Resource.
3. Network Analysis Made Simple
4. The Google PageRank Algorithm

   For Future

5. CS224 2020 Lecture 4