Determinarea drumului de valoare minima într-un graf cu ajutorul algoritmului Bellman-Kalaba; program aplicativ
Determining the minimum value path in a graph using the Bellman-Kalaba algorithm; application program
Author(s): Mihai Radu CostescuSubject(s): Methodology and research technology
Published by: Editura Universitaria Craiova
Keywords: minimum value path; Bellman-Kalaba algorithm;
Summary/Abstract: L'algorytme Bellman-Kalaba est utilisé pour determiner la voie optimale dans un réseau. Cet article propose un programme applicatif pour résoudre ce problème.
Journal: Revista de Științe Politice. Revue des Sciences Politiques
- Issue Year: 2007
- Issue No: 14
- Page Range: 51-54
- Page Count: 4
- Language: Romanian
