Bellman-Ford algorithm (program code report)
If the total amount of your purchases from the seller IT-shka more than:
- 2739 ₽ the discount is 20%
- 1826 ₽ the discount is 15%
- 913 ₽ the discount is 10%
- 457 ₽ the discount is 7%
- 274 ₽ the discount is 2%
Sold 6
Refunds 0
Good feedbacks 0
Bad feedbacks 0
Implementation of many examples of dynamic programming (Dijkstra's algorithm, the Bellman-Ford, Floyd-Uorshella).
The archive contains
-Finish program
-source code
-Reports presentation on 37str with complete description of the theory
Contents of the report:
1) The concept of dynamic programming
Concept and historical background
The main stages of solving the problem
2) Classification
Bellman equation of
-classical Problem
Is the greatest common subsequence
Is the greatest increasing subsequence
-Problem of drafting a distance
Is the order of matrix multiplication
Traveling salesman-problem
Is the greatest independent set of vertices in the tree
3) The problem of the shortest paths
-Production
Bellman-Ford-algorithm
-algorithm Floyd Uorshella
Algorithms Dijkstra
4) Features implementations of algorithms
5) Implementation of the results of computational experiments
6) References
The archive contains
-Finish program
-source code
-Reports presentation on 37str with complete description of the theory
Contents of the report:
1) The concept of dynamic programming
Concept and historical background
The main stages of solving the problem
2) Classification
Bellman equation of
-classical Problem
Is the greatest common subsequence
Is the greatest increasing subsequence
-Problem of drafting a distance
Is the order of matrix multiplication
Traveling salesman-problem
Is the greatest independent set of vertices in the tree
3) The problem of the shortest paths
-Production
Bellman-Ford-algorithm
-algorithm Floyd Uorshella
Algorithms Dijkstra
4) Features implementations of algorithms
5) Implementation of the results of computational experiments
6) References