# algorithm_1

**Repository Path**: baopengdu/algorithm_122

## Basic Information

- **Project Name**: algorithm_1
- **Description**: 常用的图算法 JS 实现，提供给 G6 及 Graphin 用于图分析场景使用。
- **Primary Language**: TypeScript
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 3
- **Created**: 2023-02-27
- **Last Updated**: 2023-02-27

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

### AntV Algorithm

It is an algorithm package of AntV, mainly includes graph related algorithms:

- adjacentMatrix: calculate the adjacency matrix for graph data
- connectedComponent: calculate the connected components for graph data
- degree: calculate the in degree, out degree, and total degree for nodes
- detectCycle: detect the cycles of the graph data
- dfs: depth-first search algorithm
- dijkstra: Dijkstra shortest path algorithm
- findPath: find the shortest paths and all paths for two nodes by Dijkstra
- floydWarshall: Floyd Warshall shortest path algorithm
- labelPropagation 标签传播自动聚类
- louvain: LOUVAIN clustering algorithm
- labelPropagation: Label Propagation(LP) clustering algorithm
- pageRank: page rank algorithm for nodes ranking
- neighbors: find the neighbors for a node in the graph
- minimumSpanningTree: generate the minimum spanning tree for a grpah
- GADDI: graph structural and semantic pattern matching algorithm

All the algorithms above supports to be calculated with web-worker.