Modeling the Communication Network of Shahroosta Using Graph Theory and Shortest Path Algorithms

This paper presents a conceptual framework for designing a communication network within the proposed Shahroosta structure a rural-urban hybrid model formed by merging adjacent villages while preserving their local identity. In this framework, Graph Theory is used to model the connections among villages, where each village is represented as a node and the inter-village paths as edges. To analyze network performance and design optimal routes, Dijkstra’s shortest path algorithm is applied to determine efficient service and transportation routes, while Betweenness Centrality is used to identify critical nodes within the network. Additionally, Space Syntax is employed to explore spatial integration and movement flow across the proposed structure. A hypothetical case study involving five adjacent villages with synthetic coordinates and relative distances is used to illustrate the model's functionality.

کلیدواژه ها:

Graph Theory ، Dijkstra ، Betweenness Centrality ، Space Syntax ، Shahroosta