Projects with this topic
Sort by:
-
Surveying accuracy checks of the Turkish large-scale mapping regulation BÖHHBÜY 2018: traverse misclosure and Bowditch adjustment, leveling closures, KOH position tests, control checks and Gauss area tolerances, with a Turkish CLI.
Updated -
This Python code employs the Depth-First Search (DFS) algorithm to find a path from "Arad" to "Bucharest" in the Romania map. It uses a priority queue, backtracking, and a graph representation. The DFS path is printed at the end. Skills demonstrated include graph traversal, priority queue usage, and DFS algorithm implementation.
Updated -