Automated Detection and Removal of Cycles in a Concept Map

Abstract

Over the years, concept maps have been used by several researchers to construct online learning systems. This is due to their flexibility in organizing knowledge. However, for effective use of concept maps in education, detection, and removal of cycles within them is necessary. Cycles in a concept map may result in ambiguity and confusion as one concept can lead back to itself. This study first gives brief details about concept maps and their applications in the field of education. A popular algorithm of graph theory depth-first search is then used for detection of cycles. If any cycles are found, they are removed from the graph in an iterative fashion until there are no more cycles in the graph. A Java program was written to simulate the proposed algorithm and found to yield desired results on sample graphs. Finally, the future uses of concept maps have been discussed.