# Search engines, web crawling and web graph

Please reference Principles of searching algorithms used by search engines as you reflect on the learning standard, below.

Once we have a graph which describes the relationship between nodes, we can use that data to rank pages based on the numberA unit of abstract mathematical system subject to the laws of arithmetic. of links. PageRank works this way, but is much more complicated.

Of course, computers don't use a visual directed graph. They probably use an adjacency matrix to calculateObtain a numerical answer showing the relevant stages in the working. related nodes and numberA unit of abstract mathematical system subject to the laws of arithmetic. of relations. Please watch this excellent video to better understand adjacency matrix. In the linked video, the commentator rightly critiques the big O running time of an adjacency matrix. However, for the purpose of this article and concept, you should understand how a computer might represent a graph.

## Do you understand this?

From the IB: Students should be aware of the Page Rank algorithm and explainGive a detailed account including reasons or causes. how it works.

## Standards

These standards are used from the IB Computer Science Subject Guide^{[2]}

- ExplainGive a detailed account including reasons or causes. that search engines and web crawling use the web graph to access information.

## References

- ↑ http://www.flaticon.com/
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.