Introduction - If you have any usage issues, please Google them yourself
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.
Packet : 73462682philosopher.rar filelist
源代码及可执行文件\DPG.APS
源代码及可执行文件\DPG.clw
源代码及可执行文件\DPG.cpp
源代码及可执行文件\DPG.dsp
源代码及可执行文件\DPG.dsw
源代码及可执行文件\DPG.exe
源代码及可执行文件\DPG.h
源代码及可执行文件\DPG.opt
源代码及可执行文件\DPG.plg
源代码及可执行文件\DPG.rc
源代码及可执行文件\DPGDlg.cpp
源代码及可执行文件\DPGDlg.h
源代码及可执行文件\ReadMe.txt
源代码及可执行文件\res\DPG.ico
源代码及可执行文件\res\DPG.rc2
源代码及可执行文件\resource.h
源代码及可执行文件\StdAfx.cpp
源代码及可执行文件\StdAfx.h
源代码及可执行文件\Debug
源代码及可执行文件\res
源代码及可执行文件
源代码及可执行文件\DPG.ncb