Drawing Weighted Directed Graph from It's Adjacency Matrix

被引:0
作者
毛国勇
张武
机构
[1] Shanghai University
[2] Shanghai 200072
[3] P.R. China
[4] School of Computer Engineering and Science
关键词
weighted directed graph; adjacency matrix; relationship matrix;
D O I
暂无
中图分类号
TB23 [工程制图];
学科分类号
08 ;
摘要
This paper proposes an algorithm for building weighted directed graph, defines 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.
引用
收藏
页码:407 / 410
页数:4
相关论文
共 3 条
[1]  
Huang Jing-wei.Binary tree drawing algorithm based on genetic algorithm. Journal of Software . 2000
[2]  
Dong Li-min.Design and realization of dynamic objectoriented graph editor. Computers in Engineering . 2001
[3]  
Mao Guo-yong.Algorithms and its implementation in building weighted directed graph. Journal of University of Shanghai for Science and Technology . 2003