Suppose that an engineer is trying to model airline routes b

Solution

A graph is representing the connection between two vertices by means of edges in a visual and comprehensive manner.

Hence if different airports can be considered as vertices or nodes, and the connecting paths can be considered as edges of the graph.

If u and v are two terminals we say u and v are connected as uv = e(edge) belongs to G the graph.

If two terminals are in demand of more than one flight then multiple edges or loops can be added. If two airports cannot be connected directly, using graph, the engineer can find the optimum path (less cost and distance) and connect them.

Since everything is represented on a paper with vertices and edges, it provides an easy way of presenting the data than in any other manner. Depending on the demand and availability direct connections or optimal connections or multiple connections can be arranged between cities.