Scribd
Upload
54 views1 page

Discrete Maths and Graph Theory Mindmap

Uploaded by

jeewithharry
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
54 views1 page

Discrete Maths and Graph Theory Mindmap

Uploaded by

jeewithharry
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Name:- Hariom Gupta , Roll no:- 31 , Sec:- A(CSE -AI)

Sub:- DMGT, Topic :- Application of Graph Theory TAE- II


1. Google Maps 3. The World Wide Web
The web is a huge collection of documents pointing to
each other via hyperlinks. In other words, the web is
another massive graph data set. This idea is the basis
of Google’s famous PageRank algorithm. It is an
iterative graph algorithm that determines the rank of a
web page (higher is better) based on the summed ranks
of web pages linking to them. To know their rank we
look into the summed ranks of web pages linking to
To find the shortest path, map services use graph
them. As you can see, this is an iterative procedure that
theory. Consider an example that we have ‘A’ as the
refines the ranks of all the web pages one step at a
starting node and ’N’ as the destination node. Then all
time. After converging, the
the other places between the start and destination node
can also be assumed as nodes. These nodes will be
PageRank algorithm gives 5. Circuit and Computer Chip Placement
a pretty accurate measure
connected horizontally and vertically with weighted
of how trustworthy and
edges. Here, weighted edges represent paths. Thus, all
renowned a web page is.
these nodes and edges represent a network of roads as a
directed graph.

2. Social Networks
A digitized social network describes
each user as a graph vertex and
each friendship relation as an edge 4. Product Recommendation Graphs
Amazon knows for each user, which products he has bought Graph algorithms are also important in many
between two users. The hundreds
of billions of friendship relations in (and liked). It’s a bipartite graph. On the left side are all other domains and use cases. For instance, the
he Facebook social network the users. On the right side are all the products. If a user field of computer chip design relies on resource-
together build a graph data has bought (and liked) a product, there is a connection efficient ways to place signals on a single chip.
structure of a massive scale. from the user to the product. The graph is bipartite as The numerous signals must be embedded onto
there can not be a connection between two users or two the two-dimensional plane.
Each time you use Facebook Graph Search, Facebook products. (Neither can a user by another user nor can a
runs an algorithm on this graph data structure. product buy another product.

You might also like