GPS Navigation

Harsh Vyas
2 min readApr 13, 2021

--

GPS(Ecumenical Situating System) is a satellite-predicated navigation system. It provides time and location-predicated information to a GPS receiver, located anywhere on or near the earth surface. GPS works in all weather conditions, provided there is an unobstructed line of visual perception communication with 4 or more GPS satellites. GPS is managed by the US Air Force.

A GPS operates independently of the user’s internet connection or telephone signal. However, their presence increases the effectiveness of GPS positioning. GPS was initially developed by the US government for military purpose, but currently, anyone with a GPS receiver can receive radio signals from GPS satellites.

Working of GPS navigation

GPS navigation or any other digital map divides it into hundreds of segments, with some only 24 meters long. A GPS visually examines this street as a graph divided into vertices and edges.

What is Breadth-First Search?

Depth First Search (DFS) and Breadth-First Search (BFS) are algorithms, or in simple terms, they are methods to traverse a graph.

Take a graph with 13 nodes. When Breadth-First Search is applied to this graph, the algorithm traverses from node 1 to node 2 and then to nodes 3, 4, 5,v6 (in green) and so on in the given order.

If you consider 1 (in red) as the first node, you observe that Breadth-First Search gradually moves outward, considering each neighbouring node first.

This eventually brings us to the accepted definition of the Breadth-First Search algorithm: “Breadth-First search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a “search key”‘) and explores the neighbour nodes first, before moving to the next level neighbours.”

Graph Traversal in Maps

--

--

Harsh Vyas
Harsh Vyas

No responses yet