Webgraph
programming
Webgraph
We define a directed graph to represent a web network. Define its vertices $V$ to be the set of webpages and the directed edges $E$ to be the hyperlinks so $(x, y) \in E$ if webpage $x$ has a hyperlink to $y$.
We define a directed graph to represent a web network. Define its vertices $V$ to be the set of webpages and the directed edges $E$ to be the hyperlinks so $(x, y) \in E$ if webpage $x$ has a hyperlink to $y$.