You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
38 lines
1.1 KiB
38 lines
1.1 KiB
"use strict";
|
|
|
|
Object.defineProperty(exports, "__esModule", {
|
|
value: true
|
|
});
|
|
exports.default = void 0;
|
|
var _adjacentMatrix = _interopRequireDefault(require("./adjacent-matrix"));
|
|
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
|
|
var floydWarshall = function floydWarshall(graphData, directed) {
|
|
var adjacentMatrix = (0, _adjacentMatrix.default)(graphData, directed);
|
|
var dist = [];
|
|
var size = adjacentMatrix.length;
|
|
for (var i = 0; i < size; i += 1) {
|
|
dist[i] = [];
|
|
for (var j = 0; j < size; j += 1) {
|
|
if (i === j) {
|
|
dist[i][j] = 0;
|
|
} else if (adjacentMatrix[i][j] === 0 || !adjacentMatrix[i][j]) {
|
|
dist[i][j] = Infinity;
|
|
} else {
|
|
dist[i][j] = adjacentMatrix[i][j];
|
|
}
|
|
}
|
|
}
|
|
// floyd
|
|
for (var k = 0; k < size; k += 1) {
|
|
for (var i = 0; i < size; i += 1) {
|
|
for (var j = 0; j < size; j += 1) {
|
|
if (dist[i][j] > dist[i][k] + dist[k][j]) {
|
|
dist[i][j] = dist[i][k] + dist[k][j];
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return dist;
|
|
};
|
|
var _default = floydWarshall;
|
|
exports.default = _default;
|