Results 181 to 190 of about 47,124 (214)

Board Game Supporting Learning Prim’s Algorithm and Dijkstra’s Algorithm

International Journal of Multimedia Data Engineering and Management, 2010
The concept of minimum spanning tree algorithms in data structure is difficult for students to learn and to imagine without practice. Usually, learners need to diagram the spanning trees with pen to realize how the minimum spanning tree algorithm works.
Wen-Chih Chang, Te-Hua Wang, Yan-Da Chiu
openaire   +1 more source

Study the optimization of Dijkstra’s Algorithm

Journal of Ravishankar University (PART-B)
This paper presents an optimized approach to the shortest path problem, a fundamental concern in graph theory, by improving node selection and data storage. The traditional Dijkstra's algorithm is enhanced by introducing a novel node selection strategy that prioritizes nodes with the most significant impact on the shortest path, minimizing redundant
Parmanand Parmanand, Sahdev Sahdev, Anuradha Dwivedi   +2 more
openaire   +1 more source

Dijkstra’s Algorithm — The First Look

2015
I’ll start the chapter with the description of Dijkstra’s algorithm from the Math Wiki site; it’s a very elegant description and one that is worth reading:
openaire   +1 more source

Learning Kruskal’s Algorithm, Prim’s Algorithm and Dijkstra’s Algorithm by Board Game

2008
This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories.
Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
openaire   +1 more source

Parallel Bidirectional Dijkstra's Shortest Path Algorithm

2011
This paper deals with Dijkstra's shortest path algorithm and with the possibilities of speeding-up this algorithm. This algorithm is a breadth-first-search algorithm. The search spreads circularly around the source node in order to find the shortest path from the source node to other nodes.
Gintaras Vaira, Olga Kurasova
openaire   +1 more source

Dijkstra’s Algorithm – The Closest Look

2015
Chapter 20 introduced Dijkstra’s algorithm. Here, we take a closer look at its workings, picking up the example we’ve been using of the airline flight plan. We use the algorithm to first determine the shortest among the links directly connected to the origin, so as to find the destination closest to it.
openaire   +1 more source

A generalization of Dijkstra's algorithm

Information Processing Letters, 1977
openaire   +1 more source

A Heuristic Integrated Scheduling Algorithm Based on Improved Dijkstra Algorithm

Electronics (Switzerland), 2023
Zhiqiang Xie
exaly  

Dijkstra's algorithm

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source

A methodology based on Dijkstra's algorithm and mathematical programming for optimal evacuation in process plants in the event of major tank fires

Reliability Engineering and System Safety, 2023
Nima Khakzad
exaly