Network algorithm - correction labels
oleh drigin2011
This algorithm for calculating the critical path for a network of tasks, where the weights is the time (speed) of the task, and links - is depending on the tasks of each other. Applied for parallelization of tasks to threads and calculate the maximum total time.
Tentang Saya
Independent software developer. Sociable, responsible, always ready to achieve the desired result. Magister on Mathematics and Programming science. Working with System Utilities for Windows, ERP systems, Systems with Artificial Intelligence: newral netwroks, fuzzy mathematics. Hobies: Hobbies - Electronics, Robotics, Chess
