SIGN IN SIGN UP

Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.

34083 0 0 JavaScript
2020-04-19 17:10:25 +02:00
export function TopologicalSorter () {
const graph = {}
let isVisitedNode
let finishTimeCount
let finishingTimeList
let nextNode
2020-05-04 11:58:44 +05:30
this.addOrder = function (nodeA, nodeB) {
nodeA = String(nodeA)
nodeB = String(nodeB)
graph[nodeA] = graph[nodeA] || []
graph[nodeA].push(nodeB)
}
this.sortAndGetOrderedItems = function () {
isVisitedNode = Object.create(null)
finishTimeCount = 0
finishingTimeList = []
for (const node in graph) {
2020-05-04 11:58:44 +05:30
if (Object.prototype.hasOwnProperty.call(graph, node) && !isVisitedNode[node]) {
dfsTraverse(node)
}
2020-04-19 17:10:25 +02:00
}
2020-05-04 11:58:44 +05:30
finishingTimeList.sort(function (item1, item2) {
return item1.finishTime > item2.finishTime ? -1 : 1
})
return finishingTimeList.map(function (value) { return value.node })
}
function dfsTraverse (node) {
isVisitedNode[node] = true
if (graph[node]) {
for (let i = 0; i < graph[node].length; i++) {
2020-05-04 11:58:44 +05:30
nextNode = graph[node][i]
if (isVisitedNode[nextNode]) continue
dfsTraverse(nextNode)
}
}
2020-04-19 17:10:25 +02:00
2020-05-04 11:58:44 +05:30
finishingTimeList.push({
node,
2020-05-04 11:58:44 +05:30
finishTime: ++finishTimeCount
})
}
}
2020-04-19 17:10:25 +02:00
/* TEST */
// const topoSorter = new TopologicalSorter()
// topoSorter.addOrder(5, 2)
// topoSorter.addOrder(5, 0)
// topoSorter.addOrder(4, 0)
// topoSorter.addOrder(4, 1)
// topoSorter.addOrder(2, 3)
// topoSorter.addOrder(3, 1)
// topoSorter.sortAndGetOrderedItems()