x/data-structure-typed
1
0
Fork 0
mirror of https://github.com/zrwusa/data-structure-typed.git synced 2024-11-23 12:54:04 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Optimize keywords for fullness (possibly redundant) and logical order.

Browse source
This commit is contained in:
Revone 2023-09-20 10:43:27 +08:00
parent 80570451de
commit a780e60844
1 changed files with 76 additions and 59 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

135
package.json
View file

@ -1,6 +1,6 @@
{
"name": "data-structure-typed",
"version": "1.3.3",
"version": "1.3.6",
"description": "Data Structures of Javascript & TypeScript. AVLTree, Binary Search Tree, Binary Tree, Tree Multiset, Graph, Heap, Priority Queue, Linked List.",
"main": "dist/index.js",
"module": "dist/index.js",
@ -19,98 +19,112 @@
"url": "git+https://github.com/zrwusa/data-structure-typed.git"
},
"keywords": [
"data",
"structure",
"structures",
"data structure",
"Data Structure",
"data-structure",
"data structures",
"Data Structures",
"data-structures",
"binary",
"depth",
"breadth",
"first",
"search",
"index",
"avl",
"segment",
"prefix",
"tree",
"multiset",
"directed",
"undirected",
"graph",
"min",
"max",
"heap",
"priority",
"queue",
"singly",
"doubly",
"linked",
"list",
"js",
"ts",
"javascript",
"typscript",
"sort",
"algorithm",
"binary search tree",
"Binary Search Tree",
"binary-search-tree",
"binary tree",
"Binary Tree",
"binary-tree",
"bst",
"BST",
"AVL Tree",
"avl tree",
"avl-tree",
"avl",
"tree multiset",
"Tree Multiset",
"tree-multiset",
"Tree Multiset",
"binary indexed tree",
"binary-indexed-tree",
"segment tree",
"segment-tree",
"trie",
"prefix tree",
"prefix-tree",
"dfs",
"DFS",
"dfs iterative",
"DFS Iterative",
"depth first Search",
"depth-first-Search",
"bfs",
"BFS",
"graph",
"Graph",
"breadth first search",
"dfs iterative",
"DFS Iterative",
"recursive",
"iterative",
"directed graph",
"Directed Graph",
"directed-graph",
"undirected graph",
"Undirected Graph",
"undirected-graph",
"heap",
"Heap",
"min heap",
"min-heap",
"max heap",
"max-heap",
"priority queue",
"Priority Queue",
"priority-queue",
"max priority queue",
"Max Priority Queue",
"max-priority-queue",
"min priority queue",
"Min Priority Queue",
"min-priority-queue",
"array queue",
"array-queue",
"stack",
"hash",
"deque",
"Deque",
"object deque",
"array deque",
"linked list",
"Linked List",
"linked-list",
"trie",
"Trie",
"prefix tree",
"Prefix Tree",
"prefix-tree",
"binary",
"DataStructure",
"DataStructures",
"data",
"structure",
"sort",
"segment tree",
"Segment Tree",
"segment-tree",
"binary indexed tree",
"Binary Indexed Tree",
"binary-indexed-tree",
"linked list",
"Linked List",
"linked-list",
"singly linked list",
"Singly Linked List",
"singly-linked-list",
"doubly linked list",
"Doubly Linked List",
"doubly-linked-list",
"queue",
"array queue",
"Array Queue",
"array-queue",
"Queue",
"object deque",
"Object Deque",
"array deque",
"Array Deque",
"stack",
"Stack",
"hash",
"Hash",
"morris",
"Morris",
"bellman ford",
@ -121,9 +135,12 @@
"floyd warshall",
"Floyd Warshall",
"floyd-warshall",
"Tarjan",
"tarjan",
"Tarjan's"
"Tarjan",
"Tarjan's",
"DataStructure",
"DataStructures"
],
"author": "Tyler Zeng zrwusa@gmail.com",
"license": "MIT",