BROWSER FOR DIRECTED GRAPHS.

被引:0
|
作者
Rowe, Lawrence A. [1 ]
Davis, Michael [1 ]
Messinger, Eli [1 ]
Meyer, Carl [1 ]
Spirakis, Charles [1 ]
Tuan, Allen [1 ]
机构
[1] Univ of California, Berkeley, CA,, USA, Univ of California, Berkeley, CA, USA
关键词
COMPUTER PROGRAMMING - Algorithms - MATHEMATICAL TECHNIQUES - Graph Theory;
D O I
暂无
中图分类号
学科分类号
摘要
A general-purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge crossings. Two layout algorithms were implemented. A hierarchical graph layout algorithm was found to be best for directed graphs. The graph browser also has facilities that allow it to be integrated with other applications (e. g. a program browser). These facilities and our experiences building a program call-graph browser are described.
引用
收藏
页码:61 / 76
相关论文
共 50 条
  • [41] Frequency domain analysis with bond graphs.
    Vera, C
    Mera, JM
    PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON BOND GRAPH MODELING AND SIMULATION (ICBGM'99), 1999, 31 (01): : 136 - 140
  • [42] COMPUTER OBSERVATIONS OF CYCLES IN CUBIC GRAPHS.
    Barefoot, C.A.
    Entringer, R.
    Computers & mathematics with applications, 1986, 15 (04): : 241 - 246
  • [43] The question of the hyper secretion in radio graphs.
    Gefen, J
    DEUTSCHE MEDIZINISCHE WOCHENSCHRIFT, 1927, 53 : 143 - 144
  • [44] Word processing: Tables, charts & graphs.
    Ziener, C
    LIBRARY JOURNAL, 2000, 125 (14) : 246 - 246
  • [45] LINK INHERITANCE IN ABSTRACT CLAUSE GRAPHS.
    Ohlbach, Hans Juergen
    Journal of Automated Reasoning, 1987, 3 (01): : 1 - 34
  • [46] Texture segmentation with diffusions on arbitrary graphs.
    Dong, X.
    Pollak, I.
    2005 IEEE/SP 13TH WORKSHOP ON STATISTICAL SIGNAL PROCESSING (SSP), VOLS 1 AND 2, 2005, : 719 - 721
  • [47] TAKAGI GRAPH REPRESENTATIONS OF CHANNEL GRAPHS.
    Pedersen, Ole A.
    GTE Automatic Electric Journal, 1979, 17 (01): : 14 - 21
  • [48] Some Properties of Signal Flow Graphs.
    Stukovnik, Ivan
    Pozne, Anton
    Bergelj, France
    Elektrotehniski Vestnik/Electrotechnical Review, 1983, 50 (05): : 243 - 251
  • [49] SOME LOCATION PROBLEMS ON GRID GRAPHS.
    Yamaguchi, Tadashi
    Kaji, Ikuo
    Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi), 1987, 70 (10): : 31 - 40
  • [50] PERFORMANCE OF ALGORITHMS FOR COLOURING PLANAR GRAPHS.
    Williams, M.H.
    Milne, K.T.
    1600, (27):