Solving Course Timetabling Problem Based on the Edge Coloring Methodology by Using Jedite

one of the most common issues at a school is the Course Timetabling Problem (CTP) generating. A vast number of students are enrolling in multiple classes every semester. The time concern, subjects, classrooms for both teaching staff and students make it challenging to present a perfect schedule in a limit period. Using graph knowledge is one way of solving this issue. The CTP is an NP-hard problem. It grows difficulties to complete graph levels with strict constraints. In this research, we chose the Edge coloring methodology and implemented it by utilizing the Jedit programming language tool to solve this issue. Jedit, which is a course teaching programming language, used to color a bipartite graph and outcome a scheduled course timetable. It has many available methods that are easy to implement and use in our solution. Also, we participated by adding a new method to Jedit's collections. As a result, we found that a maximum coloring (k) of an indirect bipartite graph (G) would depend on the maximum edges (E) that are sharing a vertex (N) from the same set in (G), such that (two adjacent edges would be colored with a different color). Additionally, the nodes in each set would color similarly. Finally, it cleared that Δk equals ΔE., So we concluded that Jedit is a suitable and easy new way to solve the problematic scheduling issue and provided efficient results using the proposed method.