Solving the optimal problem on graph models based on web application

Abstract

Nowadays, many students is dealing with conflicts about algorithms. Algorithm plays an important role in IT major. It is really a main branch of any problem. However, to practice solving algorithms, students must have the based knowledge instead of practicing immediately. We can see some popular algorithms such as sorting (merge, quick, heap, shell), integer factorization, shortest path problems, link analysis, network problems,… In general, everything in Information Technology has a strong relation with algorithm. IT students always update the lastest techniques to improve their work. It also means that they must have good based knowledge about algorithm. However, the trend shows that nearly 50% student in classes for Computer Science do not know how these algorithms work. And in that 50%, 25% students do not have knowledge about a famous algorithm, Dijkstra although the application of Dijkstra into life is very high. It is really an emergency number. Why? We will not mention students who have a knack for algorithm solving. There are many reasons for this problem and one of them is that students do not have a clearly instruction. This thesis will help them understand about the shortest path problem. By using the graph simulation, I give them a clearly vision about three famous algorithms namely: Dijkstra’s alogrithm, Floyd’s algorithm (or Floyd Warshall algorithm), and Kruskal’s algorithm respectively.