| Drawing Weighted Directed Graph from It＇s Adjacency Matrix |
| |
| 引用本文： | 毛国勇,张武.Drawing Weighted Directed Graph from It＇s Adjacency Matrix[J].上海大学学报(英文版),2005,9(5):407-410. |
| |
| 作者姓名： | 毛国勇 张武 |
| |
| 作者单位： | School of Computer Engineering and Science, Shanghai University, Shanghai 200072, P.R. China |
| |
| 基金项目： | Project supported by Science Foundation of Shanghai Municipal Conmission of Education （Grant No. 03A203） |
| |
| 摘 要： |
|
| 关 键 词： | 有向图 相邻矩阵 关联矩阵 图论 |
| 文章编号： | 1007-6417（2005）05-0407-04 |
| 收稿时间： | 2004-02-23 |
| 修稿时间： | 2004-08-18 |
Drawing weighted directed graph from it’s adjacency matrix |
| |
| Mao?Guo-yong,Zhang?Wu.Drawing weighted directed graph from it’s adjacency matrix[J].Journal of Shanghai University(English Edition),2005,9(5):407-410. |
| |
| Authors: | Mao Guo-yong Zhang Wu |
| |
| Institution: | (1) School of Computer Engineering and Science, Shanghai University, 200072 Shanghai, P.R. China |
| |
| Abstract: | This paper proposes an algorithm for building weighted directed graph, defmes the weighted directed relationship matrix of the graph, and describes algorithm implementation using this matrix. Based on this algorithm, an effective way for building and drawing weighted directed graphs is presented, forming a foundation for visual implementation of the algorithm in the graph theory. |
| |
| Keywords: | weighted directed graph adjacency matrix relationship matrix |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
