This Presentation Consist Of Application Of Data Strucuture Graph In Real World As Well As Computer Field

1. Graph Application
PRESENTED BY:
JAY DHOLARIYA(15IT024)
GAURANG DOBARIYA(15IT025)

2. What is Graph?
• Graph Is a Non-linear data structure.
• Contain the vertex and edges.
• Edges may be directed or undirected.
APPLICATION
REAL TIME
COMPUTER
FIELD

3. REAL TIME
• Transportation networks.
Vertices: In road networks vertices are
intersections.
Edges : Road segments between
intersection.
• Used by : Google maps, Bing maps and
now Apple IOS 9 maps for map
programs.

5. Representation of molecular
structure
• Vertex: molecule
• Edges: bond between molecule

6. Map colouring
• famous four colour theorem asserts that it
is always possible to properly colour the regions
of the map such that no two adjacent regions are
assigned the same colour, using at most four
distinct colours.

7. Map colouring

8. Three cottage problem
• "The three cottage problem
is a well-known
mathematical puzzle. It can
be stated like this:
• Three cottages on a
plane (or sphere) and
each needs to be
connected to the gas,
water, and electric
companies.
• Plannar Graph

9. Graph Centre:
• For each vertex find the length of shortest path
to the farthest vertex. Centre of the graph is the
vertex for which this value is minimal.
• hospital, a fire department, or a police
department, should be placed in a city so that
the farthest point is as close as possible.

10. 5
0

11. Shortest Path
• Consider some communications stations (for
telephony, cable television, Internet etc.) and a list
of possible connections between them, having
different costs.
• Find the cheapest way to connect these stations in a
network. This may be used for example to connect
villages to cable television, or to Internet.
• The same problem, but instead of connecting
communications stations - villages are to be
connected with roads.

12. Travelling Salesman Problem
A salesman has to visit a
number of cities to
deliver items. What is
the shortest route that
connects all the cities?

13. Airline Network
• Graph theory is already
utilised in flight
networks.
• Airlines want to
connect countless cities
in the most efficient
way, moving the most
passengers with the
fewest possible trips

14. Minimizing connection in Ic
• Integrated circuits
(ICs) consist of
millions of transistors
which need to be
connected.
• it is important to
optimise these
countless connections
to improve the
performance of the
chip.

15. Computer field
• Using GPS/Google
Maps/Yahoo Maps, to
find a route based on
shortest route.
• Finding shortest
routes in car
navigation systems

16. Computer network
• graph theory used in
all types of topology
for configure
network.
• Vertex :each device
(Router, pc, etc..)
• Edges: connection
between the devices.

17. Digital Graph
• Document link graphs. The best known example
is the link graph of the web,
• vertex: web page, directed edge: hyperlink
• Google any page that is very good will have many
other pages linking to it. Pages that are rarely
visited, or not very interesting, will be very
“lonely” in the internet graph
• This gives a way to rank websites and allows
Google to display the best results at the
beginning.

18. Database
• Databases: For representing
ER(Entity Relationship)
diagrams in databases, for
representing dependency of
tables in databases.

19. Social Network
• Connecting with friends on
social media, where each
user is a vertex, and when
users connect they create an
edge.
• Facebook,Twiter,Instagram etc…