Solution to actual dining philosophers problem

This release contains the solution for actual dining philosophers problem.

My attempt at resolving this problem uses an additional thread for waiter which decided who should eat at the given moment. There is also a queue for the waiter so the waiter thread knows who wait the longest time.

There is another additional thread which is used for finishing the program which waits for a q on a standard input stream.

User Interface is done on the main thread.

Dining philosophers problem when each philosopher owns a pair of forks

I know that this solution doesn't solve a problem or even starts to solve, but that was my first stage for this project at the University so here we are :)

It's introduction to threads.

Every philosopher has its own pair of forks which let them eat without caring about others.