mirror of
https://github.com/zrwusa/data-structure-typed.git
synced 2025-02-22 01:44:05 +00:00
[badges] coverage badges removed
This commit is contained in:
parent
ea8f993a4a
commit
474f4315f7
15
README.md
15
README.md
|
@ -1,5 +1,3 @@
|
|||
# What
|
||||
|
||||

|
||||

|
||||

|
||||
|
@ -12,6 +10,7 @@
|
|||
[//]: # ()
|
||||
|
||||
[//]: # ()
|
||||
|
||||
## Brief
|
||||
Data Structures of Javascript & TypeScript.
|
||||
|
||||
|
@ -20,7 +19,6 @@ DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search),
|
|||
morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Floyd-Warshall Algorithm,
|
||||
Tarjan's Algorithm.
|
||||
|
||||
# How
|
||||
## install
|
||||
### npm
|
||||
```bash
|
||||
|
@ -491,12 +489,13 @@ import {UndirectedGraph} from 'data-structure-typed';
|
|||
[//]: # (</ul>)
|
||||
|
||||
|
||||

|
||||

|
||||

|
||||

|
||||
[//]: # ()
|
||||
|
||||
# Why
|
||||
[//]: # ()
|
||||
|
||||
[//]: # ()
|
||||
|
||||
[//]: # ()
|
||||
|
||||
## Code design
|
||||
By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the optimal approach to data structure design.
|
||||
|
|
Loading…
Reference in a new issue