GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — add Integer.random function · lsc1414/AlgorithmVisualizer@98d7366

File tree

Expand file treeCollapse file tree
Open diff view settings
Filter options
  • algorithm
    • cryptography/affine_cipher/basic
      • data.js
    • dp/integer_partition/basic
      • data.js
    • graph_search
      • bellman_ford/shortest_path
        • code.js
      • bfs/shortest_path
        • code.js
      • dfs/shortest_path
        • code.js
      • dijkstra/shortest_path
        • code.js
    • search/binary_search
      • iterative
        • code.js
      • recursive
        • code.js
    • string/knuth_morris_pratt/substring_search
      • data.js
    • tree/binary_search_tree/bst_search
      • data.js
  • js/module/data
    • array2d.js
    • coordinate_system.js
    • index.js
    • integer.js
    • weighted_directed_graph.js
    • weighted_undirected_graph.js
  • public
    • algorithm_visualizer.js.map
    • algorithm_visualizer.js
    • algorithm_visualizer.min.js.map
    • algorithm_visualizer.min.js
Expand file treeCollapse file tree
Open diff view settings
Collapse file

‎algorithm/cryptography/affine_cipher/basic/data.js‎

Copy file name to clipboard
+11-11Lines changed: 11 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,18 @@
1-
function randString (length) {
2-
var choices = 'abcdefghijklmnopqrstuvwxyz';
3-
var text = '';
1+
function randString(length) {
2+
var choices = 'abcdefghijklmnopqrstuvwxyz';
3+
var text = '';
44

5-
for (var i = 0; i < length; i++) {
6-
text += choices [Math.floor (Math.random () * choices.length)];
7-
}
5+
for (var i = 0; i < length; i++) {
6+
text += choices[Integer.random(0, choices.length - 1)];
7+
}
88

9-
return text;
9+
return text;
1010
}
1111

1212
//var plainText = randString (5);
1313
var plainText = 'secret';
14-
var ptTracer = new Array1DTracer ('Encryption');
15-
var ctTracer = new Array1DTracer ('Decryption');
16-
var logger = new LogTracer ();
14+
var ptTracer = new Array1DTracer('Encryption');
15+
var ctTracer = new Array1DTracer('Decryption');
16+
var logger = new LogTracer();
1717

18-
ptTracer._setData (plainText);
18+
ptTracer._setData(plainText);
Collapse file

‎algorithm/dp/integer_partition/basic/data.js‎

Copy file name to clipboard
+3-3Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,10 @@
11
var tracer = new Array2DTracer().attach(new LogTracer());
2-
var integer = Math.floor(Math.random() * 10) + 5;
2+
var integer = Integer.random(5, 14);
33
var D = [], A = [];
4-
for (var i = 0; i <= integer; i++){
4+
for (var i = 0; i <= integer; i++) {
55
D.push([]);
66
D[0][i] = 1;
77
D[i][1] = 1;
8-
for (var j = 0; j <= integer; j++) D[i][j]=0;
8+
for (var j = 0; j <= integer; j++) D[i][j] = 0;
99
}
1010
tracer._setData(D);
Collapse file

‎algorithm/graph_search/bellman_ford/shortest_path/code.js‎

Copy file name to clipboardExpand all lines: algorithm/graph_search/bellman_ford/shortest_path/code.js
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@ function BELLMAN_FORD(src, dest) {
5252
return weights[dest];
5353
}
5454

55-
var src = Math.random() * G.length | 0, dest;
55+
var src = Integer.random(0, G.length - 1), dest;
5656
var MAX_VALUE = Infinity;
5757
var minWeight;
5858

@@ -62,7 +62,7 @@ var minWeight;
6262
*/
6363

6464
do {
65-
dest = Math.random() * G.length | 0;
65+
dest = Integer.random(0, G.length - 1);
6666
}
6767
while (src === dest);
6868

Collapse file

‎algorithm/graph_search/bfs/shortest_path/code.js‎

Copy file name to clipboardExpand all lines: algorithm/graph_search/bfs/shortest_path/code.js
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -23,10 +23,10 @@ function BFS() {
2323
}
2424
return W[e];
2525
}
26-
var s = Math.random() * G.length | 0; // s = start node
26+
var s = Integer.random(0, G.length - 1); // s = start node
2727
var e; // e = start node
2828
do {
29-
e = Math.random() * G.length | 0;
29+
e = Integer.random(0, G.length - 1);
3030
} while (s == e);
3131
var MAX_VALUE = Infinity;
3232
logger._print('finding the shortest path from ' + s + ' to ' + e);
Collapse file

‎algorithm/graph_search/dfs/shortest_path/code.js‎

Copy file name to clipboardExpand all lines: algorithm/graph_search/dfs/shortest_path/code.js
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -20,10 +20,10 @@ function DFS(node, parent, weight) { // node = current node, parent = previous n
2020
D[node] = false; // label current node as undiscovered
2121
tracer._leave(node, parent, 0)._wait();
2222
}
23-
var s = Math.random() * G.length | 0; // s = start node
23+
var s = Integer.random(0, G.length - 1); // s = start node
2424
var e; // e = end node
2525
do {
26-
e = Math.random() * G.length | 0;
26+
e = Integer.random(0, G.length - 1);
2727
} while (s == e);
2828
var MAX_VALUE = Infinity;
2929
var minWeight = MAX_VALUE;
Collapse file

‎algorithm/graph_search/dijkstra/shortest_path/code.js‎

Copy file name to clipboardExpand all lines: algorithm/graph_search/dijkstra/shortest_path/code.js
+2-2Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -39,10 +39,10 @@ function Dijkstra(start, end) {
3939
}
4040
}
4141

42-
var s = Math.random() * G.length | 0; // s = start node
42+
var s = Integer.random(0, G.length - 1); // s = start node
4343
var e; // e = end node
4444
do {
45-
e = Math.random() * G.length | 0;
45+
e = Integer.random(0, G.length - 1);
4646
} while (s == e);
4747
logger._print('finding the shortest path from ' + s + ' to ' + e)._wait();
4848
Dijkstra(s, e);
Collapse file

‎algorithm/search/binary_search/iterative/code.js‎

Copy file name to clipboardExpand all lines: algorithm/search/binary_search/iterative/code.js
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ function BinarySearch(array, element) { // array = sorted array, element = eleme
3737
return -1;
3838
}
3939

40-
var element = D[Math.random() * D.length | 0];
40+
var element = D[Integer.random(0, D.length - 1)];
4141

4242
logger._print('Using iterative binary search to find ' + element);
4343
BinarySearch(D, element, 0, D.length - 1);
Collapse file

‎algorithm/search/binary_search/recursive/code.js‎

Copy file name to clipboardExpand all lines: algorithm/search/binary_search/recursive/code.js
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ function BinarySearch(array, element, minIndex, maxIndex) { // array = sorted ar
3333
return -1;
3434
}
3535

36-
var element = D[Math.random() * D.length | 0];
36+
var element = D[Integer.random(0, D.length - 1)];
3737

3838
logger._print('Using binary search to find ' + element);
3939
BinarySearch(D, element, 0, D.length - 1);
Collapse file

‎algorithm/string/knuth_morris_pratt/substring_search/data.js‎

Copy file name to clipboard
+12-12Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,19 @@
1-
function randString (length) {
2-
var result = Math.random ().toString (36);
3-
return result.substring (result.length - length);
1+
function randString(length) {
2+
var result = Math.random().toString(36);
3+
return result.substring(result.length - length);
44
}
55

6-
var string = randString (15), substring = randString (5);
6+
var string = randString(15), substring = randString(5);
77
//var string = 'abcxabcdabxabcdabcdabxabcda', substring = 'xabcda';
88
//var string = 'abcxabcdabxabcdabcdabcyiuhsiuhduiahdubhbuuabcdabcysbhbh', substring = 'abcdabcy';
99

10-
var track = Array.apply (null, Array (substring.length)).map (Number.prototype.valueOf, 0);
10+
var track = Array.apply(null, Array(substring.length)).map(Number.prototype.valueOf, 0);
1111

12-
var trackTracer = new Array1DTracer ('Tracker'),
13-
substrTracer = new Array1DTracer ('Substring'),
14-
stringTracer = new Array1DTracer ('Major String');
15-
var logger = new LogTracer ();
12+
var trackTracer = new Array1DTracer('Tracker'),
13+
substrTracer = new Array1DTracer('Substring'),
14+
stringTracer = new Array1DTracer('Major String');
15+
var logger = new LogTracer();
1616

17-
trackTracer._setData (track);
18-
substrTracer._setData (substring);
19-
stringTracer._setData (string);
17+
trackTracer._setData(track);
18+
substrTracer._setData(substring);
19+
stringTracer._setData(string);
Collapse file

‎algorithm/tree/binary_search_tree/bst_search/data.js‎

Copy file name to clipboardExpand all lines: algorithm/tree/binary_search_tree/bst_search/data.js
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1]
2727
[9, -1]
2828
];
2929

30-
var key = Math.random() * G.length | 0; // item to be searched
30+
var key = Integer.random(0, G.length - 1); // item to be searched
3131
var tracer = new DirectedGraphTracer(" Binary Search Tree ")._setTreeData(G, 5);
3232
var logger = new LogTracer(" Log ");
3333
tracer.attach(logger);

0 commit comments

Comments
0 (0)
You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.