In view of the poor quality Chinese Reading Teaching in junior middle school, this paper puts forward metacognitive ability evaluation method for school students based on Dijkstra algorithm, constructs management system students, optimizes reading indexes and algorithm combined with Finally, experiment proves that has high practicability process practical application, can better ensure teaching...

We present a parallel priority data structure that im proves the running time of certain algorithms for prob lems that lack a fast and work e cient parallel solu tion As a main application we give a parallel imple mentation of Dijkstra s algorithm which runs in O n time while performing O m log n work on a CREW PRAM This is a logarithmic factor improvement for the running time compared with pre...

Além de ser clara a aplicabilidade dessas técnicas para o problema de motoristas, correios ou serviços de emergência, existe uma motivação muito mais importante para se começar a estudá-los: a determinação dos menores caminhos aparece constante e consistentemente como um subproblema de problemas mais complexos em grafos. 2.1 Algoritmo de Dijkstra: Entre um dado ponto e os demais No algoritmo de...

Dijkstra is a greedy algorithm that gives choice of several available shortest routes and then provides solution. The application Dijkstra's Algorithm in everyday life very diverse. This study collects research results regarding the to solve problems such as path problem, this mini-review paper can explain for various things, including solving bi-objective routes, multi-objective emergency evac...