Online Environment for Prototyping and Testing Graph and Network Algorithms

被引:0
|
作者
Banach, Kamil [1 ]
Kasprzyk, Rafal [1 ]
机构
[1] Mil Univ Technol, Fac Cybernet, 2 Kaliskiego St, PL-00908 Warsaw, Poland
关键词
Graph and network theory; Algorithms prototyping; Algorithms visualization;
D O I
10.1007/978-3-030-30604-5_11
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper there is presented an online, high-available software environment for prototyping and testing graph & network algorithms. The environment is divided into two components: an algorithms' code editor and a graph & network visual editor. The aim of the tool was to provide an easily accessible, extendable environment for prototyping and testing algorithms with real-time interactive visualization. Developed environment can be also successfully used for educational purposes in graph and network related university courses.
引用
收藏
页码:125 / 134
页数:10
相关论文
共 50 条
  • [1] GD-Workbench: A system for prototyping and testing graph drawing algorithms
    Buti, L
    DiBattista, G
    Liotta, G
    Tassinari, E
    Vargiu, F
    Vismara, L
    [J]. GRAPH DRAWING, 1996, 1027 : 111 - 122
  • [2] A functional environment for prototyping Evolutionary Algorithms
    Hawkins, J
    Abdallah, A
    [J]. IC-AI'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 1-III, 2000, : 531 - 537
  • [3] Online Graph Algorithms with Predictions
    Azar, Yossi
    Panigrahi, Debmalya
    Touitou, Noam
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 35 - 66
  • [4] Graph and network algorithms
    Khuller, S
    Raghavachari, B
    [J]. ACM COMPUTING SURVEYS, 1996, 28 (01) : 43 - 45
  • [5] JAVENGA: JAva']JAva-Based Visualization Environment for Network and Graph Algorithms
    Baloukas, Thanasis
    [J]. COMPUTER APPLICATIONS IN ENGINEERING EDUCATION, 2012, 20 (02) : 255 - 268
  • [6] ONLINE GRAPH ALGORITHMS WITH SPQR-TREES
    DIBATTISTA, G
    TAMASSIA, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 598 - 611
  • [7] Relaxing the Irrevocability Requirement for Online Graph Algorithms
    Boyar, Joan
    Favrholdt, Lene M.
    Kotrbcik, Michal
    Larsen, Kim S.
    [J]. ALGORITHMICA, 2022, 84 (07) : 1916 - 1951
  • [8] PARALLEL AND ONLINE GRAPH-COLORING ALGORITHMS
    HALLDORSSON, MM
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 61 - 70
  • [9] Relaxing the Irrevocability Requirement for Online Graph Algorithms
    Joan Boyar
    Lene M. Favrholdt
    Michal Kotrbčík
    Kim S. Larsen
    [J]. Algorithmica, 2022, 84 : 1916 - 1951
  • [10] Online Algorithms for Network Formation
    Meng, De
    Fazel, Maryam
    Mesbahi, Mehran
    [J]. 2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 135 - 140