عناصر مشابهة
Dijkstra’s Shortest Distance Connecting Lebanese Urban Centers
| المصدر: | مجلة دراسات جامعية في الآداب والعلوم الإنسانية |
|---|---|
| الناشر: |
الجامعة اللبنانية - كلية الآداب والعلوم الإنسانية - مركز الأبحاث والدراسات
|
| المؤلف الرئيسي: | |
| مؤلفين آخرين: | |
| المجلد/العدد: | ع14 |
| محكمة: | نعم |
| الدولة: | لبنان |
| التاريخ الميلادي: | 2023 |
| الصفحات: | 75 - 93 |
| ISSN: | 2707-1863 |
| رقم MD: | 1429598 |
| نوع المحتوى: | بحوث ومقالات |
| اللغة: | English |
| قواعد المعلومات: | HumanIndex |
| مواضيع: | |
| رابط المحتوى: |
| المستخلص: | A network is a system of interconnected elements affecting communication, transportation, and energy flow (electricity …). Networks can be embodied as a set of nodes representing spatial locations, and a set of links representing connections. The Dijkstra’s algorithm finds the shortest path between two or more points. Paths with nodes not corresponding to intersections are usually used to map the connectivity of a network where an interference may occur between its different intersecting elements. Such maps were produced for Lebanese urban centers at both the scale of the whole Lebanon, and that of each of its mouhafazat (provinces). The chosen grid dimensions were optimized, having been minimized to entirely avoid path intersections, while simultaneously maintaining a sufficient size to facilitate feasible computational processing times. Summary statistics (average distance …) were inferred for the resulting networks with shortest paths. The Mount Lebanon mouhafaza shows the longest total shortest path, and that of Baalbek – Hermel the sparsest clustering of urban centers. The produced maps of shortest path constitute a fundamental basis for the development of any interference network type in Lebanon, especially considering the large development opportunities in the country. |
|---|
