Scribd
Upload
119 views5 pages

At2 Candelaria

The document provides two floor plans of a hospital and asks the reader to draw a graph representing the floor plans where rooms are vertices and doorways are edges. It asks if it is possible to walk through and pass through each doorway once without repeating and if starting and ending in the same room matters. It concludes that an Eulerian circuit exists since each vertex has an even degree, so starting and ending in the same room allows visiting each doorway once. It also provides a travel planning problem asking to draw a weighted graph of travel costs between Philippine islands and find low-cost routes using greedy and edge-picking algorithms.

Uploaded by

Kimberly Igbalic
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
119 views5 pages

At2 Candelaria

The document provides two floor plans of a hospital and asks the reader to draw a graph representing the floor plans where rooms are vertices and doorways are edges. It asks if it is possible to walk through and pass through each doorway once without repeating and if starting and ending in the same room matters. It concludes that an Eulerian circuit exists since each vertex has an even degree, so starting and ending in the same room allows visiting each doorway once. It also provides a travel planning problem asking to draw a weighted graph of travel costs between Philippine islands and find low-cost routes using greedy and edge-picking algorithms.

Uploaded by

Kimberly Igbalic
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/ 5

AT2: Graphing the hospital floor

Expected Output: Graphing and Analysis (Individual Activity)


Instruction: Using a bond paper or any computer software, answer the following problem.
USE BLACK INK ONLY AND WRITE CLEARLY.

Problem:
Two floor plans of a hospital floor is shown. Draw a graph that represents the floor plan, where
each vertex represents a room and an edge connects two vertices if there is a doorway between
the two rooms. Is it possible to walk through the hospital and pass through each doorway
without going through any doorway twice? Does it depend on whether you return to the room
you started at? Justify your conclusion.

Since there are four vertices with odd degrees, there is no Euler path Theorem by the
Euler path. There is an Eulerian circuit since the degree of every vertex is even.
Therefore, if there is an Eulerian circuit, If a person begins in the same room, a route
allows the individual to visit each passage once.
According to the Eulerian Theorem, the graph is Eulerian since each vertex is of degree 2
or 4. As a result, an Eulerian circuit exists. If a person begins in the same room, there is a
route that allows the individual to visit each passage once.

AT 2: PH Travel Plan

Expected Output: Travel Graph and Budget-wise travel plan.


Problem scenario: Juan wants to tour Philippine Islands. She will start and end his journey in
Davao and visit Cebu, Manila, Siargao, and Iloilo. The promo airfares available to him between
places are given in the table. Draw a weighted graph that represents the travel costs between
places and use the greedy algorithm and edge-picking algorithm to find a low-cost route.

Destinations Davao Cebu Manila Siargao Iloilo

Davao - Php 845 Php 1275 Php 470 Php 880

Cebu Php 845 - Php 320 Php 515 Php 340

Manila Php 1275 Php 320 - Php 520 Php 365

Siargao Php 470 Php 515 Php 520 - Php 225


Please refer to the weighted graph above

GREEDY ALGORITHM:
Davao-Surigao-IloIlo-Cebu-Manila-Davao

EDGE-PICKING ALGORITHM
Siargao-IloIlo-Cebu-Manila-Davao-Siargao

You might also like