Skip to content

Commit 9212e6d

Browse files
lvltelvlte
committed
Remove live code & console.log, leave examples as comments (Geometry, Graphs, Maths).
1 parent 29d2a84 commit 9212e6d

18 files changed

+199
-217
lines changed

‎Geometry/ConvexHullGraham.js‎

Lines changed: 19 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22
* Author: Arnab Ray
33
* ConvexHull using Graham Scan
44
* Wikipedia: https://en.wikipedia.org/wiki/Graham_scan
5-
* Given a set of points in the plane. The Convex hull of the set is the smallest convex polygon that contains all the points of it.
5+
* Given a set of points in the plane. The Convex hull of the set is the smallest
6+
* convex polygon that contains all the points of it.
67
*/
78

89
function compare (a, b) {
@@ -27,7 +28,7 @@ function orientation (a, b, c) {
2728
function convexHull (points) {
2829
const pointsLen = points.length
2930
if (pointsLen <= 2) {
30-
console.log('Minimum of 3 points is required to form closed polygon!')
31+
throw new Error('Minimum of 3 points is required to form closed polygon!')
3132
}
3233

3334
points.sort(compare)
@@ -65,18 +66,22 @@ function convexHull (points) {
6566
for (let i = lowerPoints.length - 1; i >= 0; i--) {
6667
hull.push(lowerPoints[i])
6768
}
68-
console.log('The Convex Hull found is: \n')
69-
console.log(hull)
69+
70+
return hull
7071
}
7172

72-
const points = [
73-
{ x: 0, y: 3 },
74-
{ x: 1, y: 1 },
75-
{ x: 2, y: 2 },
76-
{ x: 4, y: 4 },
77-
{ x: 0, y: 0 },
78-
{ x: 1, y: 2 },
79-
{ x: 3, y: 1 },
80-
{ x: 3, y: 3 }]
73+
export { convexHull }
74+
75+
// Example
76+
77+
// const points = [
78+
// { x: 0, y: 3 },
79+
// { x: 1, y: 1 },
80+
// { x: 2, y: 2 },
81+
// { x: 4, y: 4 },
82+
// { x: 0, y: 0 },
83+
// { x: 1, y: 2 },
84+
// { x: 3, y: 1 },
85+
// { x: 3, y: 3 }]
8186

82-
convexHull(points)
87+
// convexHull(points)

‎Graphs/ConnectedComponents.js‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -45,12 +45,12 @@ class GraphUnweightedUndirectedAdjacencyList {
4545
}
4646
}
4747

48-
function main () {
49-
const graph = new GraphUnweightedUndirectedAdjacencyList()
50-
graph.addEdge(1, 2) // Component 1
51-
graph.addEdge(3, 4) // Component 2
52-
graph.addEdge(3, 5) // Component 2
53-
console.log(graph.connectedComponents())
54-
}
48+
export { GraphUnweightedUndirectedAdjacencyList }
49+
50+
// Example
5551

56-
main()
52+
// const graph = new GraphUnweightedUndirectedAdjacencyList()
53+
// graph.addEdge(1, 2) // Component 1
54+
// graph.addEdge(3, 4) // Component 2
55+
// graph.addEdge(3, 5) // Component 2
56+
// const components = graph.connectedComponents()

‎Graphs/Density.js‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,4 +8,5 @@ function density (numberOfNodes, numberOfEdges, isDirected = false) {
88
return (multi * numberOfEdges) / (numberOfNodes * (numberOfNodes - 1))
99
}
1010

11-
console.log(density(10, 2))
11+
export { density }
12+

‎Graphs/DepthFirstSearchIterative.js‎

Lines changed: 10 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -38,14 +38,14 @@ class GraphUnweightedUndirected {
3838
}
3939
}
4040

41-
function main () {
42-
const graph = new GraphUnweightedUndirected()
43-
graph.addEdge(1, 2)
44-
graph.addEdge(2, 3)
45-
graph.addEdge(2, 4)
46-
graph.addEdge(3, 5)
47-
console.log(graph.DFSIterative(5, 1))
48-
console.log(graph.DFSIterative(5, 100))
49-
}
41+
export { GraphUnweightedUndirected }
42+
43+
// Example
5044

51-
main()
45+
// const graph = new GraphUnweightedUndirected()
46+
// graph.addEdge(1, 2)
47+
// graph.addEdge(2, 3)
48+
// graph.addEdge(2, 4)
49+
// graph.addEdge(3, 5)
50+
// graph.DFSIterative(5, 1)
51+
// graph.DFSIterative(5, 100)

‎Graphs/DepthFirstSearchRecursive.js‎

Lines changed: 8 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -33,14 +33,12 @@ class GraphUnweightedUndirected {
3333
}
3434
}
3535

36-
function main () {
37-
const graph = new GraphUnweightedUndirected()
38-
graph.addEdge(1, 2)
39-
graph.addEdge(2, 3)
40-
graph.addEdge(2, 4)
41-
graph.addEdge(3, 5)
42-
console.log(graph.DFSRecursive(5, 1))
43-
console.log(graph.DFSRecursive(5, 100))
44-
}
36+
export { GraphUnweightedUndirected }
4537

46-
main()
38+
// const graph = new GraphUnweightedUndirected()
39+
// graph.addEdge(1, 2)
40+
// graph.addEdge(2, 3)
41+
// graph.addEdge(2, 4)
42+
// graph.addEdge(3, 5)
43+
// graph.DFSRecursive(5, 1)
44+
// graph.DFSRecursive(5, 100)

‎Graphs/Dijkstra.js‎

Lines changed: 21 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -47,30 +47,30 @@ function djikstra (graph, V, src) {
4747
return dist
4848
}
4949

50-
const V = 9
51-
const E = [
52-
[0, 1, 4],
53-
[0, 7, 8],
54-
[1, 7, 11],
55-
[1, 2, 8],
56-
[7, 8, 7],
57-
[6, 7, 1],
58-
[2, 8, 2],
59-
[6, 8, 6],
60-
[5, 6, 2],
61-
[2, 5, 4],
62-
[2, 3, 7],
63-
[3, 5, 14],
64-
[3, 4, 9],
65-
[4, 5, 10]
66-
]
50+
export { createGraph, djikstra }
6751

68-
const graph = createGraph(V, E)
69-
const distances = djikstra(graph, V, 0)
52+
// const V = 9
53+
// const E = [
54+
// [0, 1, 4],
55+
// [0, 7, 8],
56+
// [1, 7, 11],
57+
// [1, 2, 8],
58+
// [7, 8, 7],
59+
// [6, 7, 1],
60+
// [2, 8, 2],
61+
// [6, 8, 6],
62+
// [5, 6, 2],
63+
// [2, 5, 4],
64+
// [2, 3, 7],
65+
// [3, 5, 14],
66+
// [3, 4, 9],
67+
// [4, 5, 10]
68+
// ]
69+
70+
// const graph = createGraph(V, E)
71+
// const distances = djikstra(graph, V, 0)
7072

7173
/**
7274
* The first value in the array determines the minimum distance and the
7375
* second value represents the parent node from which the minimum distance has been calculated
7476
*/
75-
76-
console.log(distances)

‎Graphs/DijkstraSmallestPath.js‎

Lines changed: 37 additions & 38 deletions
Original file line numberDiff line numberDiff line change
@@ -39,28 +39,31 @@ function solve (graph, s) {
3939

4040
return solutions
4141
}
42-
// create graph
43-
const graph = {}
4442

45-
const layout = {
46-
R: ['2'],
47-
2: ['3', '4'],
48-
3: ['4', '6', '13'],
49-
4: ['5', '8'],
50-
5: ['7', '11'],
51-
6: ['13', '15'],
52-
7: ['10'],
53-
8: ['11', '13'],
54-
9: ['14'],
55-
10: [],
56-
11: ['12'],
57-
12: [],
58-
13: ['14'],
59-
14: [],
60-
15: []
61-
}
43+
export { solve }
44+
45+
// // create graph
46+
// const graph = {}
47+
48+
// const layout = {
49+
// R: ['2'],
50+
// 2: ['3', '4'],
51+
// 3: ['4', '6', '13'],
52+
// 4: ['5', '8'],
53+
// 5: ['7', '11'],
54+
// 6: ['13', '15'],
55+
// 7: ['10'],
56+
// 8: ['11', '13'],
57+
// 9: ['14'],
58+
// 10: [],
59+
// 11: ['12'],
60+
// 12: [],
61+
// 13: ['14'],
62+
// 14: [],
63+
// 15: []
64+
// }
6265

63-
// convert uni-directional to bi-directional graph
66+
// // convert uni-directional to bi-directional graph
6467
// let graph = {
6568
// a: {e:1, b:1, g:3},
6669
// b: {a:1, c:1},
@@ -72,26 +75,22 @@ const layout = {
7275
// h: {f:1}
7376
// };
7477

75-
for (const id in layout) {
76-
if (!graph[id]) { graph[id] = {} }
77-
layout[id].forEach(function (aid) {
78-
graph[id][aid] = 1
79-
if (!graph[aid]) { graph[aid] = {} }
80-
graph[aid][id] = 1
81-
})
82-
}
78+
// for (const id in layout) {
79+
// if (!graph[id]) { graph[id] = {} }
80+
// layout[id].forEach(function (aid) {
81+
// graph[id][aid] = 1
82+
// if (!graph[aid]) { graph[aid] = {} }
83+
// graph[aid][id] = 1
84+
// })
85+
// }
8386

84-
// choose start node
85-
const start = '10'
86-
// get all solutions
87-
const solutions = solve(graph, start)
87+
// // choose start node
88+
// const start = '10'
89+
// // get all solutions
90+
// const solutions = solve(graph, start)
8891

89-
console.log("From '" + start + "' to")
90-
// display solutions
91-
for (const s in solutions) {
92-
if (!solutions[s]) continue
93-
console.log(' -> ' + s + ': [' + solutions[s].join(', ') + '] (dist:' + solutions[s].dist + ')')
94-
}
92+
// // for s in solutions..
93+
// ' -> ' + s + ': [' + solutions[s].join(', ') + '] (dist:' + solutions[s].dist + ')'
9594

9695
// From '10' to
9796
// -> 2: [7, 5, 4, 2] (dist:4)

‎Graphs/FloydWarshall.js‎

Lines changed: 22 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -23,26 +23,26 @@ const FloydWarshall = (dist) => {
2323
return dist
2424
}
2525

26-
const main = () => {
27-
// For the following graph (edge weights are shown in brackets)
28-
// 4 1 dist[1][2] = dist[2][1] = 1
29-
// \ (2)/ \ dist[1][3] = dist[3][1] = 2
30-
// \ / \(1) dist[1][4] = dist[4][1] = Infinity
31-
// (1)\ / \ dist[3][4] = dist[4][3] = 1
32-
// 3 2 dist[2][4] = dist[4][2] = Infinity
33-
// dist[2][3] = dist[3][2] = Infinity
34-
// Output should be:
35-
// [ [0, 1, 2, 3],
36-
// [1, 0, 3, 4],
37-
// [2, 3, 0, 1],
38-
// [3, 4, 1, 0] ]
39-
console.log(FloydWarshall(
40-
[[0, 1, 2, Infinity],
41-
[1, 0, Infinity, Infinity],
42-
[2, Infinity, 0, 1],
43-
[Infinity, Infinity, 1, 0]
44-
]
45-
))
46-
}
26+
export { FloydWarshall }
27+
28+
// For the following graph (edge weights are shown in brackets)
29+
// 4 1 dist[1][2] = dist[2][1] = 1
30+
// \ (2)/ \ dist[1][3] = dist[3][1] = 2
31+
// \ / \(1) dist[1][4] = dist[4][1] = Infinity
32+
// (1)\ / \ dist[3][4] = dist[4][3] = 1
33+
// 3 2 dist[2][4] = dist[4][2] = Infinity
34+
// dist[2][3] = dist[3][2] = Infinity
35+
// Output should be:
36+
// [ [0, 1, 2, 3],
37+
// [1, 0, 3, 4],
38+
// [2, 3, 0, 1],
39+
// [3, 4, 1, 0] ]
40+
41+
// FloydWarshall(
42+
// [[0, 1, 2, Infinity],
43+
// [1, 0, Infinity, Infinity],
44+
// [2, Infinity, 0, 1],
45+
// [Infinity, Infinity, 1, 0]
46+
// ]
47+
// )
4748

48-
main()

‎Graphs/KruskalMST.js‎

Lines changed: 8 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -101,15 +101,12 @@ class GraphWeightedUndirectedAdjacencyList {
101101
}
102102
}
103103

104-
function main () {
105-
const graph = new GraphWeightedUndirectedAdjacencyList()
106-
graph.addEdge(1, 2, 1)
107-
graph.addEdge(2, 3, 2)
108-
graph.addEdge(3, 4, 1)
109-
graph.addEdge(3, 5, 100) // Removed in MST
110-
graph.addEdge(4, 5, 5)
111-
console.log(graph)
112-
console.log(graph.KruskalMST())
113-
}
104+
export { GraphWeightedUndirectedAdjacencyList }
114105

115-
main()
106+
// const graph = new GraphWeightedUndirectedAdjacencyList()
107+
// graph.addEdge(1, 2, 1)
108+
// graph.addEdge(2, 3, 2)
109+
// graph.addEdge(3, 4, 1)
110+
// graph.addEdge(3, 5, 100) // Removed in MST
111+
// graph.addEdge(4, 5, 5)
112+
// graph.KruskalMST()

‎Graphs/NodeNeighbors.js‎

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -30,11 +30,11 @@ class Graph {
3030
}
3131
}
3232

33-
(() => {
34-
const graph = new Graph()
35-
graph.addEdge(1, 2)
36-
graph.addEdge(2, 3)
37-
graph.addEdge(3, 5)
38-
graph.addEdge(1, 5)
39-
console.log(graph.nodeNeighbors(1))
40-
})()
33+
export { Graph }
34+
35+
// const graph = new Graph()
36+
// graph.addEdge(1, 2)
37+
// graph.addEdge(2, 3)
38+
// graph.addEdge(3, 5)
39+
// graph.addEdge(1, 5)
40+
// graph.nodeNeighbors(1)

0 commit comments

Comments
 (0)