DocumentCode
3777236
Title
The adjacency matrix calculation based on the acquisition method diagram
Author
Mengwei Lai; Wen Zhou
Author_Institution
School of Computer Engineering and Science, Shanghai University, China
Volume
1
fYear
2015
Firstpage
138
Lastpage
141
Abstract
It is possible to calculate if there is a path or several paths between two vertices in a graph by the calculation of adjacency matrix, however, the paths themselves cannot be recorded by the calculation of adjacency matrix. This paper proposes an accurate method of calculation by showing the paths of matrices. The operations on path matrices to calculate and record path between two vertices can be very handy and help to determine possible paths more easily. It provides a new method to solve problems efficiently and effectively such as the traveling salesman problem.
Keywords
"Traveling salesman problems","Urban areas","Computers","Symmetric matrices","Algorithm design and analysis","Optimization","Computer science"
Publisher
ieee
Conference_Titel
Computer Science and Network Technology (ICCSNT), 2015 4th International Conference on
Type
conf
DOI
10.1109/ICCSNT.2015.7490723
Filename
7490723
Link To Document