// the find
atharvshankar/FleetManagementSystem
Console based C Program to enhance utilization of taxi fleet and optimize for profit.
A single-file C console program built as an academic exercise — it models a toy taxi fleet, uses Dijkstra's algorithm to find pickup-to-dropoff routes between hubs, and stores customers in a BST for lookup by name. Useful only as a worked example of these two data structures in plain C, not as anything resembling production fleet software.
Actually implements Dijkstra's algorithm over a hub/distance graph rather than faking it, and uses a BST for customer lookup instead of a linear scan — both are real, functioning implementations of textbook algorithms. The whole thing lives in one FMS.c file with flat .txt files as its data store, so you can read it start to finish in one sitting with no build system or dependencies to fight.
Persistence is plain text files (Cars.txt, Cust.txt, Distance.txt, Hubs.txt) with presumably no schema validation, no locking, and no recovery from malformed rows — this breaks the moment two processes touch it or a file gets hand-edited. Single monolithic .c file means no separation between graph logic, BST logic, and I/O, so nothing here is unit-testable as written. Zero commits since February 2022, zero stars, no license, no tests, and no build instructions beyond the one-line README description — this is an unmaintained student assignment, not a library anyone should build on.