floyd knapsack

Floyd-Warshall算法（Floyd-Warshall algorithm）是解决任意两点间的最短路径的一种算法，可以正确处理有向图或负权的最短路径问题，同时也被用于计算有向图的传递闭包。Floyd-Warshall算法的时间复杂度为O(N3)，空间复杂度为O(N2)。

背包问题(Knapsack problem)是一种组合优化的NP完全问题。问题可以描述为：给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高。问题的名称来源于如何选择最合适的物品放置于给定背包中。-floyd knapsack

Floyd-Warshall algorithm (Floyd-Warshall algorithm) is an algorithm to solve the shortest path between any two points can correctly handle have the shortest path to the map or negative weights, but also be used to calculate the transitive closure of a directed graph package. Floyd-Warshall time complexity of the algorithm is O (N3), space complexity is O (N2).

Knapsack problem (Knapsack problem) is NP-complete optimization of a composition. The problem can be described as follows: given a set of items, each item has its own weight and price, for a limited total weight, how we choose to make the total price of the most goods. The name comes　the question of how to choose the most suitable place objects in a given backpack.