0a5f6a8047
- Go backend (server/)
- Frontend (web/, server/static/)
- Database and deployment files
- Scripts and docs
Co-Authored-By: 狸花猫/Claude-Qwen3.6-Plus 🐾
7.7 KiB
@antv/graphlib / Exports / algorithm
Namespace: algorithm
Table of contents
Functions
- components
- dfs
- dijkstra
- dijkstraAll
- findCycles
- floydWarshall
- isAcyclic
- postorder
- preorder
- prim
- tarjan
- topsort
Functions
components
▸ components<NodeIDType>(graph): NodeIDType[][]
Type parameters
| Name |
|---|
NodeIDType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, Record<string, any>, Record<string, any>, string> |
Returns
NodeIDType[][]
Defined in
dfs
▸ dfs<NodeIDType>(graph, node, order): NodeIDType[]
description DFS traversal.
description.zh-cn DFS 遍历。
Type parameters
| Name | Type |
|---|---|
NodeIDType |
any |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, any, any, any> |
node |
NodeIDType | NodeIDType[] |
order |
"pre" | "post" |
Returns
NodeIDType[]
Defined in
dijkstra
▸ dijkstra<NodeIDType, EdgeType>(graph, source, weightFn?, edgeFn?): Record<string, Entry<NodeIDType>>
description Dijkstra's algorithm for single-source shortest paths.
description https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
description.zh-cn Dijkstra 算法用于单源最短路径。
Type parameters
| Name |
|---|
NodeIDType |
EdgeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, any, EdgeType, string> |
source |
NodeIDType |
weightFn? |
(node: DefaultEdgeType<NodeIDType, EdgeType>) => number |
edgeFn? |
(node: NodeIDType) => DefaultEdgeType<NodeIDType, EdgeType>[] |
Returns
Record<string, Entry<NodeIDType>>
Defined in
dijkstraAll
▸ dijkstraAll<NodeType, EdgeType>(graph, weightFn?, edgeFn?): Record<any, Record<string, Entry<unknown>>>
Type parameters
| Name |
|---|
NodeType |
EdgeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeType, any, EdgeType, string> |
weightFn? |
(node: DefaultEdgeType<NodeType, EdgeType>) => number |
edgeFn? |
(node: NodeType) => DefaultEdgeType<NodeType, EdgeType>[] |
Returns
Record<any, Record<string, Entry<unknown>>>
Defined in
findCycles
▸ findCycles<NodeType>(graph): NodeType[][]
Type parameters
| Name |
|---|
NodeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeType, Record<string, any>, Record<string, any>, string> |
Returns
NodeType[][]
Defined in
floydWarshall
▸ floydWarshall<NodeIDType, EdgeType>(graph, weightFn?, edgeFn?): Record<string, Record<string, Entry<NodeIDType>>>
Type parameters
| Name |
|---|
NodeIDType |
EdgeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, any, EdgeType, string> |
weightFn? |
(node: DefaultEdgeType<NodeIDType, EdgeType>) => number |
edgeFn? |
(node: NodeIDType) => DefaultEdgeType<NodeIDType, EdgeType>[] |
Returns
Record<string, Record<string, Entry<NodeIDType>>>
Defined in
isAcyclic
▸ isAcyclic(graph): boolean
Parameters
| Name | Type |
|---|---|
graph |
Graph<string, Record<string, any>, Record<string, any>, string> |
Returns
boolean
Defined in
postorder
▸ postorder<NodeType>(graph, nodes): NodeType[]
Type parameters
| Name |
|---|
NodeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeType, any, any, any> |
nodes |
NodeType | NodeType[] |
Returns
NodeType[]
Defined in
preorder
▸ preorder<NodeType>(graph, nodes): NodeType[]
Type parameters
| Name |
|---|
NodeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeType, any, any, any> |
nodes |
NodeType | NodeType[] |
Returns
NodeType[]
Defined in
prim
▸ prim<NodeIdType, NodeType, EdgeType>(graph, weightFn): Graph<NodeIdType, NodeType, EdgeType, string>
Type parameters
| Name |
|---|
NodeIdType |
NodeType |
EdgeType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIdType, NodeType, EdgeType, string> |
weightFn |
(node: DefaultEdgeType<NodeIdType, EdgeType>) => number |
Returns
Graph<NodeIdType, NodeType, EdgeType, string>
Defined in
tarjan
▸ tarjan<NodeIDType>(graph): NodeIDType[][]
description Tarjan's algorithm for finding the strongly connected components of a graph.
description https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
description.zh-cn Tarjan 算法用于找到图的强连通子图。
Type parameters
| Name |
|---|
NodeIDType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, Record<string, any>, Record<string, any>, string> |
Returns
NodeIDType[][]
Defined in
topsort
▸ topsort<NodeIDType>(graph): NodeIDType[]
Type parameters
| Name |
|---|
NodeIDType |
Parameters
| Name | Type |
|---|---|
graph |
Graph<NodeIDType, Record<string, any>, Record<string, any>, string> |
Returns
NodeIDType[]