MOGRAPH: Mobile graph algorithms library for engineering students

Abstract

In this study a mobile application called MOGRAPH which has been developed for the teaching graphs is presented By using MOGRAPH students can draw and edit previously formed graphs apply Depth First Search (DFS) Breadth First Search (BFS) Dijkstra's Shortest Path Euler Path/Circuit Hamilton Path/Circuit and Graph Coloring algorithms on the undirected (weighted or unweighted) graphs created by them and take a quiz to test their knowledge. Results show that at least 79% of the students have liked the educational features of the MOGRAPH package and have thought it would be beneficial for future use. © 2007 TEMPUS Publications. © 2012 Elsevier B.V. All rights reserved.