Philosophers

A solution to the classic Dining Philosophers problem in C with threads and mutexes. Simulates philosophers sharing forks around a table, with configurable timings and optional meal limits. Focuses on avoiding deadlocks and starvation with a clear, predictable design.