Finding a spanning tree of minimum weight with the application of the algorithm Kruskal and algorithm Prima
Автор: Batchaeva Z.B., Bidzhieva A.B., Turkliev R.A.
Журнал: Мировая наука @science-j
Рубрика: Основной раздел
Статья в выпуске: 10 (19), 2018 года.
Бесплатный доступ
In recent decades, there has been a significant increase in interest in graph theory. Born more than 200 years ago in solving puzzles and entertaining problems, it has become a common, accessible and powerful tool for solving a vast range of important practical problems. Graph theory is considered as a branch of discrete mathematics that studies the properties of finite sets with established relations between their components. As an applied discipline, graph theory provides an opportunity to define and study many technical, economic, biological and social systems. The task of the material is to follow, basically, the main concepts and results of graph theory, necessary for the formulation and solution of problems of management of organizational systems.
Graph theory, minimal spanning tree, kraskala algorithm, prima algorithm
Короткий адрес: https://sciup.org/140263132
IDR: 140263132