Created
February 25, 2020 03:55
-
-
Save thehashrocket/042d61b2fb928978c7df350330b21460 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
queueCreator = () => { | |
const queue = [] | |
return { | |
add(x) { | |
queue.unshift(x) | |
}, | |
remove() { | |
if (queue.length === 0) { | |
return undefined | |
} | |
return queue.pop() | |
}, | |
next() { | |
if (queue.length === 0) { | |
return undefined | |
} | |
return queue[queue.length - 1] | |
}, | |
get length() { | |
return queue.length | |
}, | |
empty() { | |
return queue.length === 0 | |
} | |
} | |
} | |
nodeCreator = (id) => { | |
const neighbors = [] | |
return { | |
id, | |
neighbors, | |
addNeighbors(node) { | |
neighbors.push(node) | |
} | |
} | |
} | |
graphCreator = (uni = false) => { | |
const nodes = [] | |
const edges = [] | |
return { | |
uni, | |
nodes, | |
edges, | |
addNode(id) { | |
nodes.push(nodeCreator(id)) | |
}, | |
searchNode(id) { | |
return nodes.find(n => n.id === id) | |
}, | |
addEdge(idOne, idTwo) { | |
const a = this.searchNode(idOne) | |
const b = this.searchNode(idTwo) | |
a.addNeighbors(b) | |
if (!uni) { | |
b.addNeighbors(a) | |
} | |
edges.push(`${idOne}${idTwo}`) | |
}, | |
display() { | |
return nodes.map(({neighbors, id}) => { | |
let output = `${id}` | |
if (neighbors.length) { | |
output += ` => ${neighbors.map(node => node.id).join(' ')}` | |
} | |
return output | |
}).joing('\n') | |
}, | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment