用图形界面模拟如下场景：一个圆桌上有一个大碗面，5个盘子，每位哲学家一个，还有5把叉子。每个想吃饭的哲学家将做到桌子旁边分配给他的位置上，使用盘子两侧的叉子，取面和吃面。问题是：设计一个算法以允许哲学家吃饭。算法必须保证互斥（没有两位哲学家同时使用同一把叉子），同时还要避免死锁和饥饿。-Use graphical interface simulation scenario is as follows: a round-table, there is a large bowl, five plates, one for each philosopher, there are five forks. Every philosopher would like to eat will be allocated to the table next to his position, the use of plates on both sides of the fork, take surface and eat noodles. The question is: to design an algorithm to allow philosophers to eat. Algorithm must ensure that mutually exclusive (no two philosophers use the same fork at the same time), but also to avoid deadlock and starvation.