data-structure-typed 1.3.0 → 1.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/package.json +43 -5
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "data-structure-typed",
|
|
3
|
-
"version": "1.3.
|
|
3
|
+
"version": "1.3.1",
|
|
4
4
|
"description": "Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.",
|
|
5
5
|
"main": "dist/index.js",
|
|
6
6
|
"module": "dist/index.js",
|
|
@@ -19,19 +19,26 @@
|
|
|
19
19
|
"url": "git+https://github.com/zrwusa/data-structure-typed.git"
|
|
20
20
|
},
|
|
21
21
|
"keywords": [
|
|
22
|
+
"data structure",
|
|
22
23
|
"Data Structure",
|
|
23
24
|
"data-structure",
|
|
25
|
+
"data structures",
|
|
24
26
|
"Data Structures",
|
|
25
27
|
"data-structures",
|
|
26
28
|
"algorithm",
|
|
29
|
+
"binary search tree",
|
|
27
30
|
"Binary Search Tree",
|
|
28
31
|
"binary-search-tree",
|
|
32
|
+
"binary tree",
|
|
29
33
|
"Binary Tree",
|
|
30
34
|
"binary-tree",
|
|
35
|
+
"bst",
|
|
31
36
|
"BST",
|
|
32
37
|
"AVL Tree",
|
|
38
|
+
"avl tree",
|
|
33
39
|
"avl-tree",
|
|
34
40
|
"avl",
|
|
41
|
+
"tree multiset",
|
|
35
42
|
"Tree Multiset",
|
|
36
43
|
"tree-multiset",
|
|
37
44
|
"Tree Multiset",
|
|
@@ -43,21 +50,31 @@
|
|
|
43
50
|
"BFS",
|
|
44
51
|
"graph",
|
|
45
52
|
"Graph",
|
|
53
|
+
"directed graph",
|
|
46
54
|
"Directed Graph",
|
|
47
55
|
"directed-graph",
|
|
56
|
+
"undirected graph",
|
|
48
57
|
"Undirected Graph",
|
|
49
58
|
"undirected-graph",
|
|
59
|
+
"heap",
|
|
50
60
|
"Heap",
|
|
61
|
+
"priority queue",
|
|
51
62
|
"Priority Queue",
|
|
52
63
|
"priority-queue",
|
|
64
|
+
"max priority queue",
|
|
53
65
|
"Max Priority Queue",
|
|
54
66
|
"max-priority-queue",
|
|
67
|
+
"min priority queue",
|
|
55
68
|
"Min Priority Queue",
|
|
56
69
|
"min-priority-queue",
|
|
70
|
+
"deque",
|
|
57
71
|
"Deque",
|
|
72
|
+
"linked list",
|
|
58
73
|
"Linked List",
|
|
59
74
|
"linked-list",
|
|
75
|
+
"trie",
|
|
60
76
|
"Trie",
|
|
77
|
+
"prefix tree",
|
|
61
78
|
"Prefix Tree",
|
|
62
79
|
"prefix-tree",
|
|
63
80
|
"binary",
|
|
@@ -66,26 +83,47 @@
|
|
|
66
83
|
"data",
|
|
67
84
|
"structure",
|
|
68
85
|
"sort",
|
|
86
|
+
"segment tree",
|
|
69
87
|
"Segment Tree",
|
|
70
88
|
"segment-tree",
|
|
89
|
+
"binary indexed tree",
|
|
71
90
|
"Binary Indexed Tree",
|
|
72
91
|
"binary-indexed-tree",
|
|
92
|
+
"linked list",
|
|
73
93
|
"Linked List",
|
|
74
94
|
"linked-list",
|
|
95
|
+
"singly linked list",
|
|
75
96
|
"Singly Linked List",
|
|
76
97
|
"singly-linked-list",
|
|
98
|
+
"doubly linked list",
|
|
77
99
|
"Doubly Linked List",
|
|
78
100
|
"doubly-linked-list",
|
|
101
|
+
"queue",
|
|
102
|
+
"array queue",
|
|
103
|
+
"Array Queue",
|
|
104
|
+
"array-queue",
|
|
79
105
|
"Queue",
|
|
106
|
+
"object deque",
|
|
80
107
|
"Object Deque",
|
|
108
|
+
"array deque",
|
|
81
109
|
"Array Deque",
|
|
110
|
+
"stack",
|
|
82
111
|
"Stack",
|
|
112
|
+
"hash",
|
|
83
113
|
"Hash",
|
|
84
114
|
"morris",
|
|
85
|
-
"
|
|
86
|
-
"
|
|
87
|
-
"
|
|
88
|
-
"
|
|
115
|
+
"Morris",
|
|
116
|
+
"bellman ford",
|
|
117
|
+
"Bellman Ford",
|
|
118
|
+
"bellman-ford",
|
|
119
|
+
"dijkstra",
|
|
120
|
+
"Dijkstra",
|
|
121
|
+
"floyd warshall",
|
|
122
|
+
"Floyd Warshall",
|
|
123
|
+
"floyd-warshall",
|
|
124
|
+
"Tarjan",
|
|
125
|
+
"tarjan",
|
|
126
|
+
"Tarjan's"
|
|
89
127
|
],
|
|
90
128
|
"author": "Tyler Zeng zrwusa@gmail.com",
|
|
91
129
|
"license": "MIT",
|