@antv/algorithm
Advanced tools
Comparing version 0.1.8-beta.7 to 0.1.8
@@ -6,3 +6,3 @@ import getAdjMatrix from './adjacent-matrix'; | ||
import { getInDegree, getOutDegree } from './degree'; | ||
import detectCycle from './detect-cycle'; | ||
import detectCycle, { detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle } from './detect-cycle'; | ||
import depthFirstSearch from './dfs'; | ||
@@ -19,4 +19,10 @@ import dijkstra from './dijkstra'; | ||
import { getNeighbors } from './util'; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
declare const detectDirectedCycle: (graphData: import("./types").GraphData) => { | ||
[key: string]: string; | ||
}; | ||
declare const detectDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, detectDirectedCycle, detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectDirectedCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
declare const _default: { | ||
@@ -32,2 +38,8 @@ getAdjMatrix: (graphData: import("./types").GraphData, directed?: boolean) => import("./types").Matrix[]; | ||
}; | ||
detectDirectedCycle: (graphData: import("./types").GraphData) => { | ||
[key: string]: string; | ||
}; | ||
detectAllCycles: (graphData: import("./types").GraphData, directed?: boolean, nodeIds?: string[], include?: boolean) => any[]; | ||
detectAllDirectedCycle: (graphData: import("./types").GraphData, nodeIds?: string[], include?: boolean) => any[]; | ||
detectAllUndirectedCycle: (graphData: import("./types").GraphData, nodeIds?: string[], include?: boolean) => any[]; | ||
depthFirstSearch: typeof depthFirstSearch; | ||
@@ -63,2 +75,14 @@ dijkstra: (graphData: import("./types").GraphData, source: string, directed?: boolean, weightPropertyName?: string) => { | ||
}>; | ||
detectDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllCyclesAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllUndirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
dijkstraAsync: (graphData: import("./types").GraphData, source: string, directed?: boolean, weightPropertyName?: string) => Promise<{ | ||
@@ -65,0 +89,0 @@ length: number; |
@@ -6,3 +6,3 @@ import getAdjMatrix from './adjacent-matrix'; | ||
import { getInDegree, getOutDegree } from './degree'; | ||
import detectCycle from './detect-cycle'; | ||
import detectCycle, { detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle } from './detect-cycle'; | ||
import depthFirstSearch from './dfs'; | ||
@@ -19,4 +19,6 @@ import dijkstra from './dijkstra'; | ||
import { getNeighbors } from './util'; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync }; | ||
var detectDirectedCycle = detectCycle; | ||
var detectDirectedCycleAsync = detectCycleAsync; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, detectDirectedCycle, detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectDirectedCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync }; | ||
export default { | ||
@@ -30,2 +32,6 @@ getAdjMatrix: getAdjMatrix, | ||
detectCycle: detectCycle, | ||
detectDirectedCycle: detectDirectedCycle, | ||
detectAllCycles: detectAllCycles, | ||
detectAllDirectedCycle: detectAllDirectedCycle, | ||
detectAllUndirectedCycle: detectAllUndirectedCycle, | ||
depthFirstSearch: depthFirstSearch, | ||
@@ -49,2 +55,6 @@ dijkstra: dijkstra, | ||
detectCycleAsync: detectCycleAsync, | ||
detectDirectedCycleAsync: detectDirectedCycleAsync, | ||
detectAllCyclesAsync: detectAllCyclesAsync, | ||
detectAllDirectedCycleAsync: detectAllDirectedCycleAsync, | ||
detectAllUndirectedCycleAsync: detectAllUndirectedCycleAsync, | ||
dijkstraAsync: dijkstraAsync, | ||
@@ -51,0 +61,0 @@ findAllPathAsync: findAllPathAsync, |
@@ -7,2 +7,6 @@ export declare const ALGORITHM: { | ||
detectCycle: string; | ||
detectDirectedCycle: string; | ||
detectAllCycles: string; | ||
detectAllDirectedCycle: string; | ||
detectAllUndirectedCycle: string; | ||
dijkstra: string; | ||
@@ -9,0 +13,0 @@ findAllPath: string; |
@@ -7,2 +7,6 @@ export var ALGORITHM = { | ||
detectCycle: 'detectCycle', | ||
detectDirectedCycle: 'detectDirectedCycle', | ||
detectAllCycles: 'detectAllCycles', | ||
detectAllDirectedCycle: 'detectAllDirectedCycle', | ||
detectAllUndirectedCycle: 'detectAllUndirectedCycle', | ||
dijkstra: 'dijkstra', | ||
@@ -9,0 +13,0 @@ findAllPath: 'findAllPath', |
@@ -31,3 +31,3 @@ import { GraphData, DegreeType, Matrix, ClusterData, EdgeConfig, NodeConfig } from '../types'; | ||
/** | ||
* 检测图中的 Cycle | ||
* 检测图中的(有向) Cycle | ||
* @param graphData 图数据 | ||
@@ -39,2 +39,23 @@ */ | ||
/** | ||
* 检测图中的(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllCyclesAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* 检测图中的所有(有向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllDirectedCycleAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* 检测图中的所有(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllUndirectedCycleAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* Dijkstra's algorithm, See {@link https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm} | ||
@@ -127,2 +148,2 @@ * @param graphData 图数据 | ||
declare const GADDIAsync: (graphData: GraphData, pattern: GraphData, directed: boolean, k: number, length: number, nodeLabelProp?: string, edgeLabelProp?: string) => Promise<GraphData[]>; | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; |
@@ -51,3 +51,3 @@ import createWorker from './createWorker'; | ||
/** | ||
* 检测图中的 Cycle | ||
* 检测图中的(有向) Cycle | ||
* @param graphData 图数据 | ||
@@ -61,2 +61,29 @@ */ | ||
/** | ||
* 检测图中的(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
var detectAllCyclesAsync = function detectAllCyclesAsync(graphData) { | ||
return createWorker(ALGORITHM.detectAllCycles)(graphData); | ||
}; | ||
/** | ||
* 检测图中的所有(有向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
var detectAllDirectedCycleAsync = function detectAllDirectedCycleAsync(graphData) { | ||
return createWorker(ALGORITHM.detectAllDirectedCycle)(graphData); | ||
}; | ||
/** | ||
* 检测图中的所有(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
var detectAllUndirectedCycleAsync = function detectAllUndirectedCycleAsync(graphData) { | ||
return createWorker(ALGORITHM.detectAllUndirectedCycle)(graphData); | ||
}; | ||
/** | ||
* Dijkstra's algorithm, See {@link https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm} | ||
@@ -196,2 +223,2 @@ * @param graphData 图数据 | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync }; | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync }; |
@@ -6,3 +6,3 @@ import getAdjMatrix from './adjacent-matrix'; | ||
import { getInDegree, getOutDegree } from './degree'; | ||
import detectCycle from './detect-cycle'; | ||
import detectCycle, { detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle } from './detect-cycle'; | ||
import depthFirstSearch from './dfs'; | ||
@@ -19,4 +19,10 @@ import dijkstra from './dijkstra'; | ||
import { getNeighbors } from './util'; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
declare const detectDirectedCycle: (graphData: import("./types").GraphData) => { | ||
[key: string]: string; | ||
}; | ||
declare const detectDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
import { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync } from './workers/index'; | ||
export { getAdjMatrix, breadthFirstSearch, connectedComponent, getDegree, getInDegree, getOutDegree, detectCycle, detectDirectedCycle, detectAllCycles, detectAllDirectedCycle, detectAllUndirectedCycle, depthFirstSearch, dijkstra, findAllPath, findShortestPath, floydWarshall, labelPropagation, louvain, minimumSpanningTree, pageRank, getNeighbors, Stack, GADDI, getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectDirectedCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
declare const _default: { | ||
@@ -32,2 +38,8 @@ getAdjMatrix: (graphData: import("./types").GraphData, directed?: boolean) => import("./types").Matrix[]; | ||
}; | ||
detectDirectedCycle: (graphData: import("./types").GraphData) => { | ||
[key: string]: string; | ||
}; | ||
detectAllCycles: (graphData: import("./types").GraphData, directed?: boolean, nodeIds?: string[], include?: boolean) => any[]; | ||
detectAllDirectedCycle: (graphData: import("./types").GraphData, nodeIds?: string[], include?: boolean) => any[]; | ||
detectAllUndirectedCycle: (graphData: import("./types").GraphData, nodeIds?: string[], include?: boolean) => any[]; | ||
depthFirstSearch: typeof depthFirstSearch; | ||
@@ -63,2 +75,14 @@ dijkstra: (graphData: import("./types").GraphData, source: string, directed?: boolean, weightPropertyName?: string) => { | ||
}>; | ||
detectDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllCyclesAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllDirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
detectAllUndirectedCycleAsync: (graphData: import("./types").GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
dijkstraAsync: (graphData: import("./types").GraphData, source: string, directed?: boolean, weightPropertyName?: string) => Promise<{ | ||
@@ -65,0 +89,0 @@ length: number; |
@@ -50,2 +50,20 @@ "use strict"; | ||
}); | ||
Object.defineProperty(exports, "detectAllCycles", { | ||
enumerable: true, | ||
get: function get() { | ||
return _detectCycle.detectAllCycles; | ||
} | ||
}); | ||
Object.defineProperty(exports, "detectAllDirectedCycle", { | ||
enumerable: true, | ||
get: function get() { | ||
return _detectCycle.detectAllDirectedCycle; | ||
} | ||
}); | ||
Object.defineProperty(exports, "detectAllUndirectedCycle", { | ||
enumerable: true, | ||
get: function get() { | ||
return _detectCycle.detectAllUndirectedCycle; | ||
} | ||
}); | ||
Object.defineProperty(exports, "depthFirstSearch", { | ||
@@ -159,2 +177,20 @@ enumerable: true, | ||
}); | ||
Object.defineProperty(exports, "detectAllCyclesAsync", { | ||
enumerable: true, | ||
get: function get() { | ||
return _index.detectAllCyclesAsync; | ||
} | ||
}); | ||
Object.defineProperty(exports, "detectAllDirectedCycleAsync", { | ||
enumerable: true, | ||
get: function get() { | ||
return _index.detectAllDirectedCycleAsync; | ||
} | ||
}); | ||
Object.defineProperty(exports, "detectAllUndirectedCycleAsync", { | ||
enumerable: true, | ||
get: function get() { | ||
return _index.detectAllUndirectedCycleAsync; | ||
} | ||
}); | ||
Object.defineProperty(exports, "dijkstraAsync", { | ||
@@ -220,3 +256,3 @@ enumerable: true, | ||
}); | ||
exports.default = void 0; | ||
exports.default = exports.detectDirectedCycleAsync = exports.detectDirectedCycle = void 0; | ||
@@ -231,3 +267,3 @@ var _adjacentMatrix = _interopRequireDefault(require("./adjacent-matrix")); | ||
var _detectCycle = _interopRequireDefault(require("./detect-cycle")); | ||
var _detectCycle = _interopRequireWildcard(require("./detect-cycle")); | ||
@@ -264,2 +300,6 @@ var _dfs = _interopRequireDefault(require("./dfs")); | ||
var detectDirectedCycle = _detectCycle.default; | ||
exports.detectDirectedCycle = detectDirectedCycle; | ||
var detectDirectedCycleAsync = _index.detectCycleAsync; | ||
exports.detectDirectedCycleAsync = detectDirectedCycleAsync; | ||
var _default = { | ||
@@ -273,2 +313,6 @@ getAdjMatrix: _adjacentMatrix.default, | ||
detectCycle: _detectCycle.default, | ||
detectDirectedCycle: detectDirectedCycle, | ||
detectAllCycles: _detectCycle.detectAllCycles, | ||
detectAllDirectedCycle: _detectCycle.detectAllDirectedCycle, | ||
detectAllUndirectedCycle: _detectCycle.detectAllUndirectedCycle, | ||
depthFirstSearch: _dfs.default, | ||
@@ -292,2 +336,6 @@ dijkstra: _dijkstra.default, | ||
detectCycleAsync: _index.detectCycleAsync, | ||
detectDirectedCycleAsync: detectDirectedCycleAsync, | ||
detectAllCyclesAsync: _index.detectAllCyclesAsync, | ||
detectAllDirectedCycleAsync: _index.detectAllDirectedCycleAsync, | ||
detectAllUndirectedCycleAsync: _index.detectAllUndirectedCycleAsync, | ||
dijkstraAsync: _index.dijkstraAsync, | ||
@@ -294,0 +342,0 @@ findAllPathAsync: _index.findAllPathAsync, |
@@ -7,2 +7,6 @@ export declare const ALGORITHM: { | ||
detectCycle: string; | ||
detectDirectedCycle: string; | ||
detectAllCycles: string; | ||
detectAllDirectedCycle: string; | ||
detectAllUndirectedCycle: string; | ||
dijkstra: string; | ||
@@ -9,0 +13,0 @@ findAllPath: string; |
@@ -13,2 +13,6 @@ "use strict"; | ||
detectCycle: 'detectCycle', | ||
detectDirectedCycle: 'detectDirectedCycle', | ||
detectAllCycles: 'detectAllCycles', | ||
detectAllDirectedCycle: 'detectAllDirectedCycle', | ||
detectAllUndirectedCycle: 'detectAllUndirectedCycle', | ||
dijkstra: 'dijkstra', | ||
@@ -15,0 +19,0 @@ findAllPath: 'findAllPath', |
@@ -31,3 +31,3 @@ import { GraphData, DegreeType, Matrix, ClusterData, EdgeConfig, NodeConfig } from '../types'; | ||
/** | ||
* 检测图中的 Cycle | ||
* 检测图中的(有向) Cycle | ||
* @param graphData 图数据 | ||
@@ -39,2 +39,23 @@ */ | ||
/** | ||
* 检测图中的(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllCyclesAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* 检测图中的所有(有向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllDirectedCycleAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* 检测图中的所有(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
declare const detectAllUndirectedCycleAsync: (graphData: GraphData) => Promise<{ | ||
[key: string]: string; | ||
}>; | ||
/** | ||
* Dijkstra's algorithm, See {@link https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm} | ||
@@ -127,2 +148,2 @@ * @param graphData 图数据 | ||
declare const GADDIAsync: (graphData: GraphData, pattern: GraphData, directed: boolean, k: number, length: number, nodeLabelProp?: string, edgeLabelProp?: string) => Promise<GraphData[]>; | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; | ||
export { getAdjMatrixAsync, connectedComponentAsync, getDegreeAsync, getInDegreeAsync, getOutDegreeAsync, detectCycleAsync, detectAllCyclesAsync, detectAllDirectedCycleAsync, detectAllUndirectedCycleAsync, dijkstraAsync, findAllPathAsync, findShortestPathAsync, floydWarshallAsync, labelPropagationAsync, louvainAsync, minimumSpanningTreeAsync, pageRankAsync, getNeighborsAsync, GADDIAsync, }; |
@@ -6,3 +6,3 @@ "use strict"; | ||
}); | ||
exports.GADDIAsync = exports.getNeighborsAsync = exports.pageRankAsync = exports.minimumSpanningTreeAsync = exports.louvainAsync = exports.labelPropagationAsync = exports.floydWarshallAsync = exports.findShortestPathAsync = exports.findAllPathAsync = exports.dijkstraAsync = exports.detectCycleAsync = exports.getOutDegreeAsync = exports.getInDegreeAsync = exports.getDegreeAsync = exports.connectedComponentAsync = exports.getAdjMatrixAsync = void 0; | ||
exports.GADDIAsync = exports.getNeighborsAsync = exports.pageRankAsync = exports.minimumSpanningTreeAsync = exports.louvainAsync = exports.labelPropagationAsync = exports.floydWarshallAsync = exports.findShortestPathAsync = exports.findAllPathAsync = exports.dijkstraAsync = exports.detectAllUndirectedCycleAsync = exports.detectAllDirectedCycleAsync = exports.detectAllCyclesAsync = exports.detectCycleAsync = exports.getOutDegreeAsync = exports.getInDegreeAsync = exports.getDegreeAsync = exports.connectedComponentAsync = exports.getAdjMatrixAsync = void 0; | ||
@@ -70,3 +70,3 @@ var _createWorker = _interopRequireDefault(require("./createWorker")); | ||
/** | ||
* 检测图中的 Cycle | ||
* 检测图中的(有向) Cycle | ||
* @param graphData 图数据 | ||
@@ -82,3 +82,3 @@ */ | ||
/** | ||
* Dijkstra's algorithm, See {@link https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm} | ||
* 检测图中的(无向) Cycle | ||
* @param graphData 图数据 | ||
@@ -90,2 +90,35 @@ */ | ||
var detectAllCyclesAsync = function detectAllCyclesAsync(graphData) { | ||
return (0, _createWorker.default)(_constant.ALGORITHM.detectAllCycles)(graphData); | ||
}; | ||
/** | ||
* 检测图中的所有(有向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
exports.detectAllCyclesAsync = detectAllCyclesAsync; | ||
var detectAllDirectedCycleAsync = function detectAllDirectedCycleAsync(graphData) { | ||
return (0, _createWorker.default)(_constant.ALGORITHM.detectAllDirectedCycle)(graphData); | ||
}; | ||
/** | ||
* 检测图中的所有(无向) Cycle | ||
* @param graphData 图数据 | ||
*/ | ||
exports.detectAllDirectedCycleAsync = detectAllDirectedCycleAsync; | ||
var detectAllUndirectedCycleAsync = function detectAllUndirectedCycleAsync(graphData) { | ||
return (0, _createWorker.default)(_constant.ALGORITHM.detectAllUndirectedCycle)(graphData); | ||
}; | ||
/** | ||
* Dijkstra's algorithm, See {@link https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm} | ||
* @param graphData 图数据 | ||
*/ | ||
exports.detectAllUndirectedCycleAsync = detectAllUndirectedCycleAsync; | ||
var dijkstraAsync = function dijkstraAsync(graphData, source, directed, weightPropertyName) { | ||
@@ -92,0 +125,0 @@ return (0, _createWorker.default)(_constant.ALGORITHM.dijkstra).apply(void 0, [graphData, source, directed, weightPropertyName]); |
{ | ||
"name": "@antv/algorithm", | ||
"version": "0.1.8-beta.7", | ||
"version": "0.1.8", | ||
"description": "graph algorithm", | ||
@@ -5,0 +5,0 @@ "keywords": [ |
Sorry, the diff of this file is too big to display
Sorry, the diff of this file is not supported yet
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
993763
10124