{"id":11382,"date":"2022-03-19T03:04:38","date_gmt":"2022-03-19T01:04:38","guid":{"rendered":"http:\/\/journals.khnu.km.ua\/vestnik\/?p=11382"},"modified":"2022-03-19T03:04:38","modified_gmt":"2022-03-19T01:04:38","slug":"programnyj-kompleks-dlya-vizualizacziyi-algorytmiv-na-grafah","status":"publish","type":"post","link":"https:\/\/journals.khnu.km.ua\/vestnik\/?p=11382","title":{"rendered":"\u041f\u0440\u043e\u0433\u0440\u0430\u043c\u043d\u0438\u0439 \u043a\u043e\u043c\u043f\u043b\u0435\u043a\u0441 \u0434\u043b\u044f \u0432\u0456\u0437\u0443\u0430\u043b\u0456\u0437\u0430\u0446\u0456\u0457 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432 \u043d\u0430 \u0433\u0440\u0430\u0444\u0430\u0445"},"content":{"rendered":"

<\/p>\n

\u041f\u0420\u041e\u0413\u0420\u0410\u041c\u041d\u0418\u0419 \u041a\u041e\u041c\u041f\u041b\u0415\u041a\u0421 \u0414\u041b\u042f \u0412\u0406\u0417\u0423\u0410\u041b\u0406\u0417\u0410\u0426\u0406\u0407 \u0410\u041b\u0413\u041e\u0420\u0418\u0422\u041c\u0406\u0412 \u041d\u0410 \u0413\u0420\u0410\u0424\u0410\u0425<\/p>\n

SOFTWARE COMPLEX FOR GRAPH ALGORITHMS VISUALIZATION<\/p>\n

\u00a0<\/strong>\u0421\u0442\u043e\u0440\u0456\u043d\u043a\u0438: 81-85. \u041d\u043e\u043c\u0435\u0440: \u21166, 2021 (303)\u00a0<\/strong> \"\"<\/a>
\n\u0410\u0432\u0442\u043e\u0440\u0438<\/strong>:
\n\u041b\u0410\u0412\u0420\u0415\u041d\u0427\u0423\u041a \u0421. \u0412.
\n\u041b\u0443\u0446\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442
\nORCID ID: 0000-0002-5453-3924
\nlavrsveet@gmail.com
\n\u0417\u0414\u041e\u041b\u0411\u0406\u0426\u042c\u041a\u0410 \u041d. \u0412.
\n\u041b\u0443\u0446\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442
\nORCID ID: 0000-0002-1345-3581
\nninazdolb@gmail.com
\n\u0425\u0410\u041c\u0423\u041b\u0410 \u041d. \u041c.
\n\u041b\u0443\u0446\u044c\u043a\u0438\u0439 \u043d\u0430\u0446\u0456\u043e\u043d\u0430\u043b\u044c\u043d\u0438\u0439 \u0442\u0435\u0445\u043d\u0456\u0447\u043d\u0438\u0439 \u0443\u043d\u0456\u0432\u0435\u0440\u0441\u0438\u0442\u0435\u0442
\nnadya.synuyk0907@gmail.com
\nSvitlana LAVRENCHUK, Nina ZDOLBITSKA, Nadiia KHAMULA
\nLutsk National Technical University
\nDOI:<\/strong> https:\/\/www.doi.org\/10.31891\/2307-5732-2021-303-6-81-85<\/a>
\n\u0420\u0435\u0446\u0435\u043d\u0437\u0456\u044f\/Peer review : <\/strong>08.11.2021 \u0440.
\n\u041d\u0430\u0434\u0440\u0443\u043a\u043e\u0432\u0430\u043d\u0430<\/strong>\/<\/strong>Printed<\/strong> :<\/strong> 30.12.2021 \u0440.<\/p>\n

\u0410\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u043c\u043e\u0432\u043e\u044e \u043e\u0440\u0438\u0433\u0456\u043d\u0430\u043b\u0443<\/strong><\/p>\n

\u0420\u043e\u0437\u0433\u043b\u044f\u043d\u0443\u0442\u043e \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0438 \u043d\u0430 \u0433\u0440\u0430\u0444\u0430\u0445, \u0449\u043e \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d\u0456 \u0437\u0430 \u0434\u043e\u043f\u043e\u043c\u043e\u0433\u043e\u044e \u0440\u0456\u0437\u043d\u0438\u0445 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440 \u0434\u0430\u043d\u0438\u0445. \u041f\u0440\u043e\u0433\u0440\u0430\u043c\u043d\u0438\u0439 \u043a\u043e\u043c\u043f\u043b\u0435\u043a\u0441 \u043c\u0430\u0454 \u043c\u043e\u0434\u0443\u043b\u044c\u043d\u0438\u0439 web-\u0456\u043d\u0442\u0435\u0440\u0444\u0435\u0439\u0441. \u0420\u0435\u0430\u043b\u0456\u0437\u043e\u0432\u0430\u043d\u043e \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u0435\u043d\u043d\u044f \u0433\u0440\u0430\u0444\u0430 \u044f\u043a \u043c\u043d\u043e\u0436\u0438\u043d\u0438 \u0432\u0435\u0440\u0448\u0438\u043d \u0443 \u0432\u0438\u0433\u043b\u044f\u0434\u0456 \u043f\u0440\u043e\u043d\u0443\u043c\u0435\u0440\u043e\u0432\u0430\u043d\u0438\u0445 \u043a\u0440\u0443\u0433\u0456\u0432 \u0442\u0430 \u0437\u0432\u2019\u044f\u0437\u043a\u0456\u0432 \u043c\u0456\u0436 \u043d\u0438\u043c\u0438 (\u0433\u0440\u0430\u0444\u0456\u0447\u043d\u0435 \u0437\u043e\u0431\u0440\u0430\u0436\u0435\u043d\u043d\u044f); \u0437\u0430 \u0434\u043e\u043f\u043e\u043c\u043e\u0433\u043e\u044e \u0434\u0438\u043d\u0430\u043c\u0456\u0447\u043d\u0438\u0445 \u0437\u0432\u2019\u044f\u0437\u0430\u043d\u0438\u0445 \u0441\u043f\u0438\u0441\u043a\u0456\u0432 (\u0441\u043f\u0438\u0441\u043a\u0438 \u0441\u0443\u043c\u0456\u0436\u043d\u043e\u0441\u0442\u0456); \u0443 \u0432\u0438\u0433\u043b\u044f\u0434\u0456 \u043c\u0430\u0442\u0440\u0438\u0446\u0456 \u0441\u0443\u043c\u0456\u0436\u043d\u043e\u0441\u0442\u0456. \u041a\u043e\u0440\u0438\u0441\u0442\u0443\u0432\u0430\u0447\u0456 \u0434\u0430\u043d\u043e\u0433\u043e \u043f\u0440\u043e\u0435\u043a\u0442\u0443 \u043c\u0430\u044e\u0442\u044c \u0437\u043c\u043e\u0433\u0443 \u0456\u043d\u0442\u0435\u0440\u0430\u043a\u0442\u0438\u0432\u043d\u043e \u0432\u043f\u043b\u0438\u0432\u0430\u0442\u0438 \u0442\u0430 \u0441\u043f\u043e\u0441\u0442\u0435\u0440\u0456\u0433\u0430\u0442\u0438 \u0437\u0430 \u043f\u043e\u043a\u0440\u043e\u043a\u043e\u0432\u0438\u043c \u0432\u0438\u043a\u043e\u043d\u0430\u043d\u043d\u044f\u043c \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u0456\u0432 \u043d\u0430 \u0433\u0440\u0430\u0444\u0430\u0445, \u0449\u043e \u0434\u0430\u0441\u0442\u044c \u0437\u043c\u043e\u0433\u0443 \u043d\u0430\u0431\u0443\u0442\u0438 \u0434\u043e\u0441\u043b\u0456\u0434\u043d\u0438\u0446\u044c\u043a\u0438\u0445 \u043d\u0430\u0432\u0438\u0447\u043e\u043a \u0442\u0430 \u043a\u043e\u043c\u043f\u0435\u0442\u0435\u043d\u0442\u043d\u043e\u0441\u0442\u0435\u0439 \u0432 \u043e\u0431\u043b\u0430\u0441\u0442\u0456 \u0432\u0438\u043a\u043e\u0440\u0438\u0441\u0442\u0430\u043d\u043d\u044f \u0434\u0438\u0441\u043a\u0440\u0435\u0442\u043d\u0438\u0445 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440.
\n\u041a\u043b\u044e\u0447\u043e\u0432\u0456 \u0441\u043b\u043e\u0432\u0430:<\/strong> \u0433\u0440\u0430\u0444, \u0434\u0438\u0441\u043a\u0440\u0435\u0442\u043d\u0456 \u0441\u0442\u0440\u0443\u043a\u0442\u0443\u0440\u0438, \u0432\u0456\u0437\u0443\u0430\u043b\u0456\u0437\u0430\u0446\u0456\u044f, \u0441\u043f\u043e\u0441\u043e\u0431\u0438 \u043f\u043e\u0434\u0430\u043d\u043d\u044f \u0433\u0440\u0430\u0444\u0430, \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043d\u0438\u0439 \u043a\u043e\u043c\u043f\u043b\u0435\u043a\u0441, \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u041f\u0440\u0438\u043c\u0430, \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0414\u0435\u0439\u043a\u0441\u0442\u0440\u0438, \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u041a\u0440\u0443\u0441\u043a\u0430\u043b\u0430, \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u0424\u043b\u043e\u0439\u0434\u0430, \u043f\u043e\u0448\u0443\u043a \u0432\u0433\u043b\u0438\u0431, \u043f\u043e\u0448\u0443\u043a \u0432\u0448\u0438\u0440.<\/p>\n

\u0420\u043e\u0437\u0448\u0438\u0440\u0435\u043d\u0430 \u0430\u043d\u043e\u0442\u0430\u0446\u0456\u044f \u0430\u043d\u0433\u043b\u0456\u0439\u0441\u044c\u043a\u043e\u044e \u043c\u043e\u0432\u043e\u044e<\/strong><\/p>\n

Algorithms on graphs represented by graphical structures are offered. The software complex has a modular web interface. A representative graph is implemented as a set of vertices in the form of numbered circles and links between them (graphic image); using dynamically linked lists (adjacency lists); using an adjacency matrix. The project of this project allows the use of interactive algorithms for step-by-step calculations and algorithms on graphical images to obtain the necessary research results and competencies in the use of discrete structures. The project was implemented using HTML, CSS, JavaScript, which allows visualizing the application and interactively working with algorithms on graphs represented by different data structures. Graphics File Algorithm Programming provides web-based and interactive algorithms created by the used DHTML itself, creating a software project in the form of a site. Each page is dedicated to a separate algorithm and structurally consists of a header, container, footer. The website design uses HTML and cascading CSS stylesheets, to create an interactive parsing process and to transform methods in graphic files \u2013 based on JavaScript, which allows third-party scripts to be processed and rendered. The user can vibrate the image type (for orientation), the number of nodes, the presentation method, generate this graph, indicate the starting point for starting the search algorithm, observe the operational operation of the algorithm. The user can adjust the animation speed. The development of a set of programs is meant for interactive demonstration and visualization of the operation of algorithms in the study of graph theory.
\nKeywords:<\/strong> graph, discrete structures, visualization, methods of graph representation, software complex, Prim’s algorithm, Dijkstra’s algorithm, Kruskal’s algorithm, Floyd’s algorithm, depth search, breadth search.<\/p>\n

References<\/strong><\/p>\n

    \n
  1. Kuzmenko I. M. Teoriia hrafiv : navchalnyi posibnyk dlia zdobuvachiv stupenia bakalavra za spetsialnistiu 122 \u00abKompiuterni nauky\u00bb [Elektronnyi resurs] \/ Ihor Mykolaiovych Kuzmenko. \u2013 KPI im. Ihoria Sikorskoho, 2020. \u2013 Rezhym dostupu : https:\/\/ela.kpi.ua\/handle\/123456789\/35854.<\/li>\n
  2. Shevchenko H. V. Dyskretna matematyka : navchalno-metodychnyi posibnyk. \/ H. V. Shevchenko, V. V. Shkapa. \u2013 Kyiv : DUT, 2018. \u2013 158 s.<\/li>\n
  3. Ostapiuk Z. V. Zastosuvannia hrafiv dlia vidobrazhennia zhyttievoho tsyklu sutnostei pid chas rozroblennia systemy opratsiuvannia vidhukiv bezposerednikh korystuvachiv prohramnykh produktiv \/ Z. V. Ostapiuk, T. O. Korotieieva \/\/ Naukovyi visnyk NLTU Ukrainy. \u2013 2019. \u201329, \u2116 9. \u2013 S. 147\u2013152.<\/li>\n
  4. Ryshkovets Yu. V. Alhorytmizatsiia ta prohramuvannia. Chastyna 2: navchalnyi posibnyk \/ Yu. V. Ryshkovets, V. A. Vysotska. \u2013 Lviv : Novyi Svit-2000, 2020. \u2013 320 s.<\/li>\n
  5. Sholom P. S. Proportsiino-intehralno-dyferentsialne upravlinnia stabilnistiu rukhu mobilnoho ahenta 3pi po zadanii traiektorii \/ P. Sholom, N. V. Zdolbitska \/\/ Kompiuterno-intehrovani tekhnolohii: osvita, nauka, vyrobnytstvo : mizhvuzivskyi zbirnyk. \u2013 Lutsk : Vydavnytstvo LNTU, 2012. \u2013 \u2116 8. \u2013 S. 125\u2013129.<\/li>\n
  6. Sholom P. S. Analiz alhorytmiv obkhodu hrafa dlia zadachi trasuvannia marshrutu \/ P. S. Sholom, N. V. Zdolbitska \/\/ Kompiuterno-intehrovani tekhnolohii: osvita, nauka, vyrobnytstvo : mizhvuzivskyi zbirnyk. \u2013 Lutsk : Vydavnytstvo LNTU, 2011. \u2013 \u2116 3. \u2013 S. 204\u2013207.<\/li>\n
  7. Lavrenchuk S. V. Doslidzhennia tekhnolohii obrobky pryrodnoi movy ta mashynnoho navchannia pry stvorenni chat-bot zasobamy Python \/ S. V. Lavrenchuk, R. S. Iliushyk. \/\/ Kompiuterno-intehrovani tekhnolohii: osvita, nauka, vyrobnytstvo : mizhvuzivskyi zbirnyk. \u2013 Lutsk : Vydavnytstvo LNTU. \u2013 2019. \u2013 \u2116 37. \u2013 S. 36\u201342.<\/li>\n
  8. Graph Theory Towards New Graphical Passwords In Information Networks [Elektronnyi resurs] \/ [Y. Bing, S. Hui, W. Hongyu ta in.]. \u2013 2018. \u2013 Rezhym dostupu : https:\/\/arxiv.org\/abs\/1806.02929.<\/li>\n
  9. Borysenko I. I. Zastosuvannia teorii hrafiv v zadachakh stvorennia stehanohrafichnykh povidomlen \/ I. I. Borysenko \/\/ Suchasna spetsialna tekhnika. \u2013 2015. \u2013 \u2116 2. \u2013 S. 26\u201333.<\/li>\n
  10. Zhyharevych O. K. Metody ta zasoby proektuvannia ta rozrobky systemy optymizatsii transportnykh marshrutiv \/ O. K. Zhyharevych \/\/ Kompiuterno-intehrovani tekhnolohii: osvita, nauka, vyrobnytstvo : mizhvuzivskyi zbirnyk. \u2013 Lutsk : Vydavnytstvo LNTU, 2013. \u2013 \u2116 11. \u2013 S.16\u201323.<\/li>\n
  11. Optimal Transport for structured data with application on graphs [Elektronnyi resurs] \/ [T. Vayer, L. Chapel, R. Flamary ta in.]. \u2013 2019. \u2013 Rezhym dostupu : https:\/\/arxiv.org\/abs\/1805.09114.<\/li>\n
  12. Biziuk A. V. Zastosuvannia teorii hrafiv do analizu strukturno-lohichnoi skhemy navchalnoho planu \/ A. V. Biziuk, V. P. Tkachenko, V. Biziuk \/\/ Tezy dopovidei IV mizhnarodnoi naukovo-tekhnichnoi konferentsii \u00abPolihrafichni, multymediini ta web-tekhnolohii\u00bb (PMW-2019), 14\u201317 travnia 2019 r., Kharkiv. \u2013 Kharkiv : Drukarnia Madryd, 2019. \u2013 S. 238-239.<\/li>\n
  13. Bobrytska H. S. Prykladne zastosuvannia teorii hrafiv u riznykh sferakh zhyttia suspilstva ta okremoi osobystosti \/ H. S. Bobrytska \/\/ Fizyko-matematychna osvita: naukovyi zhurnal. \u2013 2017. \u2013 \u2116 3. \u2013 S. 26\u201330.<\/li>\n
  14. Novozhylova L. M. Modelyrovanye hrafamy dyskretn\u044bkh system y protses sov : uchebnoe posobye \/ L. M. Novozhylova. \u2013 SPb : SPbHU, 2017. \u2013 16 s.<\/li>\n
  15. Graph Builder [Elektronnyi resurs]. \u2013 Rezhym dostupu : https:\/\/www.softportal.com\/software-19403-graph-builder.html<\/li>\n
  16. Obzor MaxFlow [Elektronnyi resurs]. \u2013 Rezhym dostupu : https:\/\/soft.mydiv.net\/win\/download-MaxFlow.html<\/li>\n
  17. Grafoanalizator [Elektronnyi resurs]. \u2013 Rezhym dostupu : https:\/\/sourceforge.net\/projects\/grafoanalizator\/<\/li>\n
  18. Graph Magics [Elektronnyi resurs]. \u2013 Rezhym dostupu : http:\/\/www.graph-magics.com\/<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[60],"tags":[],"_links":{"self":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11382"}],"collection":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=11382"}],"version-history":[{"count":1,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11382\/revisions"}],"predecessor-version":[{"id":11384,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=\/wp\/v2\/posts\/11382\/revisions\/11384"}],"wp:attachment":[{"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=11382"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=11382"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/journals.khnu.km.ua\/vestnik\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=11382"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}