2009
DOI: 10.1016/j.entcs.2008.12.059
|View full text |Cite
|
Sign up to set email alerts
|

PathFinder: A Visualization eMathTeacher for Actively Learning Dijkstra's Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(15 citation statements)
references
References 8 publications
0
15
0
Order By: Relevance
“…Will allow for the user with an intuitive and interactive user interface design diagrams graded and un-graded graphs and digraphs [5]. After constructing a diagram chart the user can to play an animation illustrating the steps of one of the four algorithms that implement the application [6].…”
Section: Related Workmentioning
confidence: 99%
“…Will allow for the user with an intuitive and interactive user interface design diagrams graded and un-graded graphs and digraphs [5]. After constructing a diagram chart the user can to play an animation illustrating the steps of one of the four algorithms that implement the application [6].…”
Section: Related Workmentioning
confidence: 99%
“…Dijkstra's algorithm identifies the shortest paths from an initial vertex to other vertices in a graph, in which each edge has a non-negative weight (distance) [30]. For a graph G = (V, E), the algorithm visits all nodes of G from a predetermined source s ∈ V. The algorithm maintains a priority queue Q, for which the key of a node u is given by the tentative distance to s, denoted by d [u].…”
Section: Optimal Path Analysismentioning
confidence: 99%
“…Finally, Section 6 addresses the response provided by the expert system based on real data, and Section 7 outlines the conclusions. environment was designed to integrate eMathTeacher-compliant tools (Sanchez-Torrubia et al, 2008;Sanchez-Torrubia et al, 2009), that is, the learner simulates algorithm execution using the respective inputs. It is also important to highlight that, in an eMathTeacher-compliant tool, algorithm simulation does not proceed until the user enters the correct answer.…”
Section: Problem-solving Specificationsmentioning
confidence: 99%
“…Since the late 1990s, we have developed several web applications for graph algorithm learning based on visualization and aimed at promoting active learning (Sanchez-Torrubia, Torres-Blanc, & Lopez-Martinez, 2009;Sanchez-Torrubia et al, 2010b). These applications were designed on the basis of the philosophy underlying the eMathTeacher specifications.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation