MMW Project 1
MMW Project 1
MMW Project 1
The researchers have utilized the graph theory to search for the shorter route from
Mapua University up to Manila Doctors Hospital. In graph theory, the researchers represent
places in between Mapua University and Manila Doctors Hospital in a map, as dots or what
are called vertices. The roads leading to said places can be represented as lines which are
called edges. In order to know all the available routes and which one is the best route, it is
necessary to graph the map of the places around Mapua University all the way Manila
Doctors Hospital and all the routes that lead to them. The Hamiltonian path is applied
where each vertex can be visited once and end on the desired vertex.,
To now know the fastest route or the most efficient route to go through, it is needed to
assign weights to the edges in the graph. The weights can represent different things but for
this purpose it represents the distances from vertex to vertex.
For the application of the methods, the researchers use MATLAB Software. This
software is a high-performance language for technical computing. It integrates
computation, visualization, and programming in an easy-to-use environment where
problems and solutions are expressed in familiar mathematical notation. Typical uses
include: (1) Math and computation; (2) Algorithm development; (3) Modeling, simulation,
and prototyping; (4) Data analysis, exploration, and visualization; (5) Scientific and
engineering graphics; (6) Application development, including Graphical User Interface
building
G. TASKS OF MEMBERS
H. LOGISTICAL NEEDS
Logistic needs are involved with the cost or the shortest and easiest way for the
establishment to be accessed. The estimated distance of Manila Doctors from Mapua
University varies according to the road or street used to travel to it. There are two streets
that leads to Manila Doctors from Mapua University – San Marcellino St and Padre Burgos
Experiment 05 [04/10/2019] 1
MAPUA UNIVERSITY
Experiment 05 [04/10/2019] 2