اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAcerca del Algoritmo de Dijkstra
103
0
0.0
(
0
)
نشر من قبل
Alvaro Salas Humberto
تاريخ النشر
2008
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Alvaro Salas
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we prove the correctness of Dijkstras algorithm. We also discuss it and at the end we show an application.
قيم البحث
اقرأ أيضاً
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been w
ritten about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to decide whether or not it is structured, that is, whether it conforms to the stated principles of structured programming. We refer to the classical concept of structured programming, as described by Dijkstra. By employing a graph model and graph-theoretic techniques, we formulate an efficient algorithm for answering this question. To do so, we first introduce the class of graphs which correspond to structured programs, which we call Dijkstra Graphs. Our problem then becomes the recognition of such graphs, for which we present a greedy $O(n)$-time algorithm. Furthermore, we describe an isomorphism algorithm for Dijkstra graphs, whose complexity is also linear in the number of vertices of the graph. Both the recognition and isomorphism algorithms have potential important applications, such as in code similarity analysis.
We present a space- and time-efficient fully dynamic implementation de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
This article is a multiauthored portrait of Edsger Wybe Dijkstra that consists of testimonials written by several friends, colleagues, and students of his. It provides unique insights into his personality, working style and habits, and his influence
on other computer scientists, as a researcher, teacher, and mentor.
The attitudes and beliefs of teachers and future physics teachers about epistemological aspects of Physics play a very important role in teaching the discipline. In this paper, after describing some of the most important results reported in the liter
ature, we present the main results of the implementation of the CLASS test on attitudes and beliefs to hundreds of student and physics teacher in Uruguay. The results corresponding to the teaching students are similar to those who choose careers with an emphasis on Physics and Mathematics and, in turn, are clearly below those presented by professors and researchers. We highlight then the need to make explicit the issues related to epistemological attitudes and beliefs in our classes.
Here we show the preliminary results of a photometric study of low surface brightness objects with $mu_{g}~gtrsim~25$~mag/arcsec$^2$. These objects are present in several fields obtained with GEMINI-GMOS, in the central region of the Pegasus I group.
We found that their photometric characteristics are similar to the so-called dwarf spheroidal galaxies or to the ultra low surface brightness galaxies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
