ALGORITHM FOR CREATING A NETWORK GRAPH OF THE PROJECT

Authors

  • A. Abdullaev

    Nukus State Pedagogical Institute named after Ajiniyaz image/svg+xml

  • U.D. Srazhova

    Nukus State Pedagogical Institute named after Ajiniyaz image/svg+xml

Keywords: top, events, numbering, time, date of occurrence, reserve, project, required path, length

Abstract

This article presents an algorithm for developing a network graph for designing complex tasks. The network graph teaches the main indicators of the task, the necessary work paths, and the completion time.

References

1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. Introduction to Algorithms, 3rd Edition. – USA: «MIT Press», 2009.

2. Колдаев В.Д. Основы алгоритмизации и программирования: Учебное пособие. Под ред. проф. Л.Г.Гагариной. - Москва: ИД «Форум»: ИНФА-М, 2006.