algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Use abbreviation for JavaScript and TypeScript

Browse Source
This commit is contained in:
krahets
2023-07-26 15:35:38 +08:00
parent 85d12360ed
commit b9b324b298
52 changed files with 310 additions and 310 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
docs/chapter_graph/graph_operations.md
View File

@@ -52,13 +52,13 @@
[class]{graphAdjMat}-[func]{}
```
=== "JavaScript"
=== "JS"
```javascript title="graph_adjacency_matrix.js"
[class]{GraphAdjMat}-[func]{}
```
=== "TypeScript"
=== "TS"
```typescript title="graph_adjacency_matrix.ts"
[class]{GraphAdjMat}-[func]{}
@@ -155,13 +155,13 @@
[class]{graphAdjList}-[func]{}
```
=== "JavaScript"
=== "JS"
```javascript title="graph_adjacency_list.js"
[class]{GraphAdjList}-[func]{}
```
=== "TypeScript"
=== "TS"
```typescript title="graph_adjacency_list.ts"
[class]{GraphAdjList}-[func]{}

8
docs/chapter_graph/graph_traversal.md
View File

@@ -48,13 +48,13 @@ BFS 通常借助「队列」来实现。队列具有“先入先出”的性质
[class]{}-[func]{graphBFS}
```
=== "JavaScript"
=== "JS"
```javascript title="graph_bfs.js"
[class]{}-[func]{graphBFS}
```
=== "TypeScript"
=== "TS"
```typescript title="graph_bfs.ts"
[class]{}-[func]{graphBFS}
@@ -183,7 +183,7 @@ BFS 通常借助「队列」来实现。队列具有“先入先出”的性质
[class]{}-[func]{graphDFS}
```
=== "JavaScript"
=== "JS"
```javascript title="graph_dfs.js"
[class]{}-[func]{dfs}
@@ -191,7 +191,7 @@ BFS 通常借助「队列」来实现。队列具有“先入先出”的性质
[class]{}-[func]{graphDFS}
```
=== "TypeScript"
=== "TS"
```typescript title="graph_dfs.ts"
[class]{}-[func]{dfs}