ROUTING TASK SOLUTION ALGORITHM BASED ON THE DYNAMIC MULTIPARAMETER CHARTS
Journal: Science and world (Vol.1, No. 51)Publication Date: 2017-11-23
Authors : Allamov O.T.;
Page : 20-25
Keywords : dynamic multi parameter graph; routing task; dynamic structures;
Abstract
Th e article provides a partial enumeration method algorithm for problem - solving on dynamic multi - parameter graphs. The partial enumeration is based on solving for the optimum using L times routs between two nodes. Dynamic structures have been used for solvin g for the optimum.
Other Latest Articles
- THE DEVICE ON THE COMBINED SEWING - UP AND APPLYING OF THE POLYMERIC COMPOSITION IN GARMENTS FROM ADRAS
- THE EFFECT OF PULSED ALL - ROUND COMPRESSION ON THE CURRENT - VOLTAGE CHARACTERISTICS OF SURFACE - BARRIER DIODES Sb p Si Mn Au
- ESTIMATION OF AREA OF ADHESIVE FORCES ACTION AT LIQUID DROP SPREADING ON THE SOLID SURFACE
- PHASE DIAGRAM OF WATER AT HI GH PRESSURE (0 - 2500 МPа) AND LOW TEMPERATURE (90 - 300 К) IN Р - Т COORDINATE
- GEOLOGICAL SIGNS OF HOT HETEROGENEOUS ACCRETION OF THE EARTH AND THE CONSEQUENCES OF IT
Last modified: 2018-08-10 16:50:08