specCon18/The-Last-Algorithms-Course-Youll-Ever-Need-Completed
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat: all the things

Browse source
This commit is contained in:
mpaulson 2022-07-19 20:44:40 -06:00
parent 44bdb7177f
commit 60205795d0
11 changed files with 216 additions and 87 deletions
Download patch file Download diff file Expand all files Collapse all files

10
scripts/dsa.js
View file

@ -41,7 +41,7 @@ const list_interface = {
module.exports = {
Map: {
generic: "<T, V>",
generic: "<T extends (string | number), V>",
type: "class",
methods: [{
name: "get",
@ -258,7 +258,7 @@ module.exports = {
CompareBinaryTrees: {
type: "fn",
fn: "compare",
args: "head: BinaryNode<number>",
args: "a: BinaryNode<number>, b: BinaryNode<number>",
"return": ": boolean",
},
@ -273,21 +273,21 @@ module.exports = {
type: "fn",
fn: "dfs",
args: "graph: WeightedAdjacencyList, source: number, needle: number",
"return": "number[]",
"return": "number[] | null",
},
BFSGraphList: {
type: "fn",
fn: "bfs",
args: "graph: WeightedAdjacencyList, source: number, needle: number",
"return": "number[]",
"return": "number[] | null",
},
BFSGraphMatrix: {
type: "fn",
fn: "bfs",
args: "graph: WeightedAdjacencyMatrix, source: number, needle: number",
"return": "number[]",
"return": "number[] | null",
},
};