NotesFAQContact Us
Collection
Advanced
Search Tips
Back to results
Peer reviewed Peer reviewed
PDF on ERIC Download full text
ERIC Number: EJ1341857
Record Type: Journal
Publication Date: 2018
Pages: 16
Abstractor: As Provided
ISBN: N/A
ISSN: EISSN-2146-5711
EISSN: N/A
Available Date: N/A
Calculating the Shortest Path Using Dijkstra's Algorithm
Journal of Inquiry Based Activities, v8 n2 p70-85 2018
The Dijkstra's algorithm is an algorithm that determines the shortest paths needed to go from a starting node to any node in a graph. In this article, the process and results of an activity that included route formation among the provinces in the Aegean region using Dijkstra's algorithm are shared. The activity was designed based on a mathematical modeling process (real life problem, mathematical problem, mathematical solution, interpreting the solution). The activity was implemented with 15 middle school students attending a Science and Art Center. The students actively participated in the activity and throughout the lesson they tried to solve the problem. The students successfully implemented the algorithm and completed the problem solving process. Future applications of this activity can be planned by taking into account some student difficulties (e.g., simple erros, not drawing the route although the value of nodes are calculated correctly) observed in this application.
Journal of Inquiry Based Activities. 61st Street, No: 14/8, Mentese, Mugla, 48000 Turkey. e-mail: editor.ated@gmail.com; Web site: https://www.ated.info.tr/ojs-3.2.1-3/index.php/ated
Publication Type: Journal Articles; Reports - Research; Tests/Questionnaires
Education Level: Junior High Schools; Middle Schools; Secondary Education
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A
Grant or Contract Numbers: N/A
Author Affiliations: N/A