Web graph and sub-graphs
A web graph[edit]
The webgraph describes the directed links between pages of the World Wide Web. A graph, in general, consists of several vertices, some pairs connected by edges. In a directed graph, edges are directed lines or arcs. The webgraph is a directed graph, whose vertices correspond to the pages of the WWW, and a directed edge connects page X to page Y if there exists a hyperlink on page X, referring to page Y.[2]
A sub graph[edit]
A graph whose vertices and edges are subsets of another graph.[3]
The web as directed graph[edit]
Each of the nodes represents a web site. Each edge represents a link either coming TO a website or leaving FROM a website.
In the case of our example above, node A links to node B. Node D also links to node B.
Do you understand this?[edit]
Standards[edit]
These standards are used from the IB Computer Science Subject Guide[4]
- Outline the difference between the web graph and sub-graphs.
References[edit]
- ↑ http://www.flaticon.com/
- ↑ https://en.wikipedia.org/wiki/Webgraph
- ↑ Paul E. Black and Alen Lovrencic, "subgraph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed 19 January 2018) Available from: https://www.nist.gov/dads/HTML/subgraph.html
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.