“We represent this as a conflict graph: each vertex equal a course, each edge equal a conflict.” Look at the picture There is the conflict graph for tweny university courses based on lecturer and student conflicts: ·Each vertex represents a single course (MK one – MK Twenty) ·Each edge represents a conflict — meaning the connected courses cannot be scheduled at the same time due to sharing the same lecturer or student. What should we do with welch powell algorithm? First, Determine Vertex Degrees
id
公開
7ヶ月前
サンプル
音声サンプルはまだありません