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

release: 1.49.1

Browse source
This commit is contained in:
Revone 2023-12-12 10:05:36 +08:00
parent e113a99b26
commit 4d88405ac1
3 changed files with 4 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
package.json
View file

@ -1,6 +1,6 @@
{
"name": "data-structure-typed",
"version": "1.49.0",
"version": "1.49.1",
"description": "Data Structures of Javascript & TypeScript. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack. Benchmark compared with C++ STL. API aligned with ES6 and Java.util. Usability is comparable to Python",
"main": "dist/cjs/index.js",
"module": "dist/mjs/index.js",

3
test/unit/data-structures/graph/directed-graph.test.ts
View file

@ -689,8 +689,7 @@ describe('DirectedGraph getCycles', () => {
graph.addEdge('E', 'B');
const cycles = graph.getCycles();
expect(cycles.size).toBe(1);
console.log(Array.from(cycles.values()));
expect(cycles.get(2)).toEqual( [{"key": "B", "value": undefined}, {"key": "D", "value": undefined}, {"key": "E", "value": undefined}]);
})
})

3
test/unit/data-structures/graph/undirected-graph.test.ts
View file

@ -278,6 +278,7 @@ describe('UndirectedGraph getCycles', () => {
graph.addEdge('E', 'B');
const cycles = graph.getCycles();
expect(cycles.size).toBe(2);
console.log(Array.from(cycles.values()));
expect(cycles.get(1)).toEqual([{"key": "A", "value": "A"}, {"key": "B", "value": "B"}, {"key": "D", "value": "D"}, {"key": "C", "value": "C"}]);
expect(cycles.get(2)).toEqual([{"key": "B", "value": "B"}, {"key": "D", "value": "D"}, {"key": "E", "value": "E"}]);
})
})