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.
71 lines
2.0 KiB
71 lines
2.0 KiB
4 months ago
|
"use strict";
|
||
|
|
|
||
|
|
Object.defineProperty(exports, "__esModule", {
|
||
|
|
value: true
|
||
|
|
});
|
||
|
|
exports.default = depthFirstSearch;
|
||
|
|
var _util = require("./util");
|
||
|
|
function initCallbacks(callbacks) {
|
||
|
|
if (callbacks === void 0) {
|
||
|
|
callbacks = {};
|
||
|
|
}
|
||
|
|
var initiatedCallback = callbacks;
|
||
|
|
var stubCallback = function stubCallback() {};
|
||
|
|
var allowTraversalCallback = function () {
|
||
|
|
var seen = {};
|
||
|
|
return function (_a) {
|
||
|
|
var next = _a.next;
|
||
|
|
if (!seen[next]) {
|
||
|
|
seen[next] = true;
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
};
|
||
|
|
}();
|
||
|
|
initiatedCallback.allowTraversal = callbacks.allowTraversal || allowTraversalCallback;
|
||
|
|
initiatedCallback.enter = callbacks.enter || stubCallback;
|
||
|
|
initiatedCallback.leave = callbacks.leave || stubCallback;
|
||
|
|
return initiatedCallback;
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* @param {Graph} graph
|
||
|
|
* @param {GraphNode} currentNode
|
||
|
|
* @param {GraphNode} previousNode
|
||
|
|
* @param {Callbacks} callbacks
|
||
|
|
*/
|
||
|
|
function depthFirstSearchRecursive(graphData, currentNode, previousNode, callbacks, directed) {
|
||
|
|
if (directed === void 0) {
|
||
|
|
directed = true;
|
||
|
|
}
|
||
|
|
callbacks.enter({
|
||
|
|
current: currentNode,
|
||
|
|
previous: previousNode
|
||
|
|
});
|
||
|
|
var _a = graphData.edges,
|
||
|
|
edges = _a === void 0 ? [] : _a;
|
||
|
|
(0, _util.getNeighbors)(currentNode, edges, directed ? 'target' : undefined).forEach(function (nextNode) {
|
||
|
|
if (callbacks.allowTraversal({
|
||
|
|
previous: previousNode,
|
||
|
|
current: currentNode,
|
||
|
|
next: nextNode
|
||
|
|
})) {
|
||
|
|
depthFirstSearchRecursive(graphData, nextNode, currentNode, callbacks, directed);
|
||
|
|
}
|
||
|
|
});
|
||
|
|
callbacks.leave({
|
||
|
|
current: currentNode,
|
||
|
|
previous: previousNode
|
||
|
|
});
|
||
|
|
}
|
||
|
|
/**
|
||
|
|
* 深度优先遍历图
|
||
|
|
* @param data GraphData 图数据
|
||
|
|
* @param startNodeId 开始遍历的节点的 ID
|
||
|
|
* @param originalCallbacks 回调
|
||
|
|
*/
|
||
|
|
function depthFirstSearch(graphData, startNodeId, callbacks, directed) {
|
||
|
|
if (directed === void 0) {
|
||
|
|
directed = true;
|
||
|
|
}
|
||
|
|
depthFirstSearchRecursive(graphData, startNodeId, '', initCallbacks(callbacks), directed);
|
||
|
|
}
|