About

A C program for dynamic graph management, supporting operations like adding/removing nodes and edges, and executing algorithms such as Dijkstra’s shortest path and Traveling Salesman Problem (TSP). It processes commands to modify graph structures and compute shortest paths.