engleski

Method of analaysing the graph connectivity

Access to single nodes in the non-directional graph of the transportation network can be defined in various ways, but if the nodes need to be classified avoiding ambiguity, then each node should be assigned a certain number. The paper uses the method for determining the access to a single node based on the description of the transportation network using the symmetric matrix of incidence. By knowing the matrix of incidence it is possible to determine the eigenvalues i.e. eigenvectors, the comparison of which determines the values for single nodes. The accessability of the city of Zagreb in the corridor network is considered. Based on the obtained results of analysis, it is possible to determine the efficiency of connecting certain nodes of the given transportation network, i.e. to suggest its improvement.

graph; accessibility; eigenvector

nije evidentirano