18 | );
19 | }
--------------------------------------------------------------------------------
/manifest.json:
--------------------------------------------------------------------------------
1 | {
2 | "short_name": "Algorithms Visualizer",
3 | "name": "Algorithms Visualizer",
4 | "icons": [
5 | {
6 | "src": "letter.ico",
7 | "sizes": "64x64 32x32 24x24 16x16",
8 | "type": "image/x-icon"
9 | },
10 | {
11 | "src": "letter.png",
12 | "type": "image/png",
13 | "sizes": "192x192"
14 | },
15 | {
16 | "src": "letter.png",
17 | "type": "image/png",
18 | "sizes": "512x512"
19 | }
20 | ],
21 | "start_url": ".",
22 | "display": "standalone",
23 | "theme_color": "#000000",
24 | "background_color": "#ffffff"
25 | }
26 |
--------------------------------------------------------------------------------
/src/Tools/InformationOfAlgorithms&Presentation/InformationMain.js:
--------------------------------------------------------------------------------
1 | const information={
2 | name: "Presentation",
3 | information:"Hi!\n\nI am a computer engineering student and in order to help both the new students and myself I have decided to make this page which is focused on the visualization of classical algorithms.\n\nOver time I will try to add more content and more abstract content apart from visualizations.\n\nAll the algorithms used in this page contain their brief explanations and their pseudocodes at the bottom of the page.\n\nI hope it helps you, have a good day!",
4 | };
5 | export default information;
--------------------------------------------------------------------------------
/src/index.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import ReactDOM from 'react-dom';
3 | import './index.css';
4 | import App from './App';
5 | import reportWebVitals from './reportWebVitals';
6 |
7 | import {HashRouter} from "react-router-dom";
8 |
9 | ReactDOM.render(
10 |
11 |
12 | ,
13 | document.getElementById('root')
14 | );
15 |
16 | // If you want to start measuring performance in your app, pass a function
17 | // to log results (for example: reportWebVitals(console.log))
18 | // or send to an analytics endpoint. Learn more: https://bit.ly/CRA-vitals
19 | reportWebVitals();
20 |
--------------------------------------------------------------------------------
/src/App.js:
--------------------------------------------------------------------------------
1 | import {Switch, Route} from "react-router-dom";
2 | import Main from './Pages/Main/Main';
3 | import sieveOfEratosthenes from "./Pages/SieveOfEratosthenes/SieveOfEratosthenes";
4 | import SimpleSortAlgorithms from "./Pages/SortAlgorithms/SimpleSortAlgorithms/SimpleSortAlgorithms";
5 | import AdvancedSortAlgorithms from "./Pages/SortAlgorithms/AdvancedSortAlgorithms/AdvancedSortAlgorithms";
6 | import Graphs from "./Pages/Graphs/Graphs";
7 | import ScrollToTop from './Tools/ScrollToTop/ScrollToTop';
8 | import Gcd from "./Pages/Gcd/Gcd"
9 |
10 | export default function App()
11 | {
12 | return (
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
23 |
24 | );
25 | }
--------------------------------------------------------------------------------
/src/Tools/InformationOfAlgorithms&Presentation/InformationSieveOfEratosthenes.js:
--------------------------------------------------------------------------------
1 | const information={
2 | name: "Sieve of Eratosthenes",
3 | information: "Given a number, the algorithm will find the prime numbers less than or equivalent to the given number.\n\nThe algorithm works as follows, given a limit number the algorithm will start accepting all numbers less than or equivalent to the limit number as primes, continuously the algorithm will start from 2, being prime it will take it as a pivot and advance on the other numbers.\n\nIf any of the other numbers contains the pivot multiplier, it will write them down as non-primes, once finished with the other numbers it will follow the same process with the following numbers, as long as the pivots are prime and are less than the root of the input number.",
4 | pseudocode: "SOE(n)\n\tisPrime🠔[true, true, ..., ...(n+1)]\n\tisPrime[0]🠔false\n\tisPrime[1]🠔false\n\tfor number🠔2 to sqrt(n) do\n\t\tif isPrime[number] then\n\t\t\tmultiplier🠔2\n\t\t\twhile number*multiplier≤n do\n\t\t\t\tisPrime[number*multiplier]🠔false\n\t\t\t\tmultiplier🠔multiplier+1\n\treturn isPrime"
5 | };
6 |
7 | export default information;
--------------------------------------------------------------------------------
/src/Tools/AlgorithmSelectionButtonGroup/AlgorithmSelectionButtonGroup.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import Button from '@material-ui/core/Button';
3 | import ButtonGroup from '@material-ui/core/ButtonGroup';
4 | import { makeStyles } from '@material-ui/core/styles';
5 |
6 | const useStyles = makeStyles((theme) => ({
7 | root: {
8 | display: 'flex',
9 | flexDirection: 'column',
10 | alignItems: 'center',
11 | '& > *': {
12 | margin: theme.spacing(1),
13 | justifyContent: 'center'
14 | },
15 | },
16 | }));
17 |
18 | export default function BasicButtonGroup({setSortType, information})
19 | {
20 | const classes = useStyles();
21 |
22 | const algorithms=Object.keys(information);
23 |
24 | return (
25 |
37 | );
38 | }
--------------------------------------------------------------------------------
/src/Tools/InformationOfAlgorithms&Presentation/InformationGCD&ExtendedGCD.js:
--------------------------------------------------------------------------------
1 | const information={
2 | name: "Extended Euclid's Algorithm",
3 | information: "Here we will focus on demonstrating the extended euclidean algorithm which helps us find the bezout coefficients, finally we will show a small implementation in the C language.",
4 | imageLink1: "https://drive.google.com/uc?id=1P7JdMAh6SSxLQPxC5Q_ujDhbNlZ0hJJ1",
5 | imageExplication1: "As we can see, we have first written what exactly the Euclidean algorithm does in each iteration.\n\nTaking the first iteration we show that we can reshape it in such a way that we can find an equivalence to the multipliers x and y, this means that in the following iterations we can apply the same logic, which means that we can already see that we will implement a recursive algorithm, now the doubt it will be when it should stop.\n\nThen we take the last iteration which is the one that gives us the result, when we open it we can see that as a multiplier the result would have a one, which here we can draw the conclusion that if the algorithm took as input this last iteration it should return the value of x as 1 and that of y as 0.\n\nNow let's see the implementation of the algorithm in the C language.",
6 | imageLink2: "https://drive.google.com/uc?id=1P3-sq7XzmfCeAWxtXf-JY6Hu-HEndHLx"
7 | };
8 | export default information;
--------------------------------------------------------------------------------
/src/Pages/Main/Main.js:
--------------------------------------------------------------------------------
1 | import Header from './../../Tools/Header/Header';
2 | import information from "../../Tools/InformationOfAlgorithms&Presentation/InformationMain";
3 | import { printInformation } from '../../Tools/PageTemplate/PrintExplicationOfAlgorithm.js';
4 | import CategoryCard from "./CategoryCard";
5 |
6 | export default function Main()
7 | {
8 | const presentation=printInformation(information);
9 | const categories=["Graphs", "Simple Sort", "Advanced Sort", "Sieve of Eratosthenes", "Extended Eucledian Algorithm","Linear Algebra"];
10 |
11 | return(
12 |
71 | );
72 | }
--------------------------------------------------------------------------------
/src/Tools/InformationOfAlgorithms&Presentation/InformationAdvancedSortAlgorithms.js:
--------------------------------------------------------------------------------
1 | const information={
2 | Quick:
3 | {
4 | name: "Quick Sort",
5 | information: "The algorithm uses the divide and conquer algorithm design paradigm, partitions the array recursively.\n\nIf the size of the array is one the algorithm will stop.",
6 | pseudocode: "QucikSort(arr, startIndex, size)\n\tif size<2 then \n\t\treturn\n\t\t\n\tswap(arr[startIndex], arr[RANDOM NUMBER BETWEEN startIndex AND size-1])\n\tposition🠔1+startIndex\n\t\n\tfor x🠔(1+startIndex) to (size+startIndex-1) do\n\t\tif arr[startIndex]>arr[x] then\n\t\t\tswap(arr[x], arr[position])\n\t\t\tposition🠔position+1\n\t\t\t\n\tswap(arr[startIndex], arr[position-1])\n\t\n\tposition🠔position-startIndex\n\tQucikSort(arr, startIndex, position-1)\n\tQucikSort(arr, startIndex+position, size-position)"
7 | },
8 |
9 | Merge:
10 | {
11 | name: "Merge Sort",
12 | information: "The algorithm uses the divide and conquer algorithm design paradigm, divides the list in two and recursively with the partitions obtained, if a partition contains one or zero elements it will not be taken into account, the algorithm in each iteration after calling itself with the two partitions obtained will order the list fragment that it has as a parameter.\n\nThe algorithm benefits from the memory allocation of the array, since by having the memory address of the array, it can manipulate the content of the array at any time in the iterations.",
13 | pseudocode: "MergeSort(arr, startIndex, size)\n\tif size<2 then \n\t\treturn\n\t\t\n\thalf🠔floor(size/2)\n\tMergeSort(arr, startIndex, half)\n\tMergeSort(arr, startIndex+half, size-half)\n\t\n\tindex🠔0\n\tleft🠔0\n\tright🠔half\n\ttemp🠔[...size]\n\t\n\twhile leftarr[index+1] then\n\t\t\t\tswapElements(arr, index, index+1)\n\t\t\t\tdidASwapOccur🠔true"
7 | },
8 |
9 | Insertion:
10 | {
11 | name: "Insertion Sort",
12 | information: "The algorithm starts from the second element of the list taking it as a pivot, it will always look at the element behind it, if it is smaller than the element behind it, it will keep the pivot element in the hand, and it will make the value of the element that is behind, then it will continue backwards always looking at the adjacent pairs, at the end it will put the pivot in the index of the last value seen in the loop plus one. The algorithm will follow the same process advancing over the entire list.",
13 | pseudocode: "InsertionSort(arr)\n\tfor pivot🠔1 to arr.lenght-1 do\n\t\tnumber🠔arr[pivot]\n\t\tbackIndex🠔pivot-1\n\t\twhile arr[backIndex]>arr[backIndex+1] && 0≤backIndex do\n\t\t\tarr[backIndex+1]🠔arr[backIndex]\n\t\tarr[backIndex+1]🠔number"
14 | },
15 |
16 | Selection:
17 | {
18 | name: "Selection Sort",
19 | information: "The algorithm will start at the beginning of the list, keeping the index of the element and counting it as the index of the smallest element, then it will move forward controlling all the remaining elements, if any of those elements are smaller than the element of the index saved then it will be It will update the index of the smallest element, thus always keeping the smallest index in hand, finally the element of the initial index will be swapped with the index of the smallest element, the algorithm will do this process until the entire list is finished.",
20 | pseudocode: "SelectionSort(arr)\n\tfor index🠔0 to arr.length-2 do\n\t\tminIndex🠔index\n\t\tfor frontIndex🠔index+1 to arr.length-1 do\n\t\t\tif arr[minIndex]>arr[frontIndex] then\n\t\t\t\tminIndex🠔frontIndex\n\t\tswapElements(arr, index, minIndex)"
21 | },
22 | };
23 | export default information;
--------------------------------------------------------------------------------
/src/logo.svg:
--------------------------------------------------------------------------------
1 |
--------------------------------------------------------------------------------
/src/Pages/Main/CategoryCard.js:
--------------------------------------------------------------------------------
1 | import React from 'react';
2 | import { makeStyles } from '@material-ui/core/styles';
3 | import Card from '@material-ui/core/Card';
4 | import CardActionArea from '@material-ui/core/CardActionArea';
5 | import CardActions from '@material-ui/core/CardActions';
6 | import CardContent from '@material-ui/core/CardContent';
7 | import CardMedia from '@material-ui/core/CardMedia';
8 | import Button from '@material-ui/core/Button';
9 | import Typography from '@material-ui/core/Typography';
10 | import {useHistory} from 'react-router-dom';
11 |
12 | const useStyles = makeStyles({
13 | root: {
14 | maxWidth: 700,
15 | marginLeft: "auto",
16 | marginRight: "auto",
17 | width: "80%",
18 | marginTop: "30px",
19 | backgroundColor: "grey",
20 | color: "white"
21 | },
22 | });
23 |
24 | export default function ImgMediaCard({categoryName}) {
25 | const classes = useStyles();
26 |
27 | let image, subcategories;
28 |
29 | try
30 | {
31 | image=require("./../../Tools/PhotosOfCategories/"+categoryName+".png").default
32 | }
33 | catch(e)
34 | {
35 | image=require("./../../Tools/PhotosOfCategories/Default.png").default;
36 | }
37 |
38 | try
39 | {
40 | subcategories=require("./../../Tools/Subcategories Names/"+categoryName+".js").default
41 | }
42 | catch(e)
43 | {
44 | subcategories=[]
45 | }
46 |
47 | const history=useHistory();
48 |
49 | return (
50 | {
51 | if(categoryName!="Linear Algebra")
52 | history.push(categoryName.replaceAll(" ", ""))
53 | else
54 | window.open("https://andresrodriguez55.github.io/LinearAlgebraCalculator/", "_blank")
55 | }}>
56 |
57 |
6 |
7 |
8 | ## Link
9 | https://andresrodriguez55.github.io/algorithmsVisualizer/#/
10 |
11 | ## Description
12 |
13 | The purpose of doing this was to learn to make animations and at the same time strengthen the knowledge of some classic algorithms.
14 |
15 | For now the page contains the visualizations of:
16 | - Deep first search
17 | - Breadth first search
18 | - Shortest path (using Dijkstra's algorithm)
19 | - Minimum spanning tree (using Kruskal's algorithm)
20 | - Bubble sort
21 | - Selection sort
22 | - Insertion sort
23 | - Quick sort
24 | - Merge sort
25 | - Sieve of eratosthenes
26 | - Linear algebra methods
27 |
28 | and the proofs of:
29 | - Extended eucledian algorithm
30 |
31 | ## How to use visualizations
32 |
33 | ### Graphs
34 | - In the section of vertices you can eliminate the vertices that are in the graph or you can add new vertices in the empty places, the application will not allow you to add a vertex very close to the sides of the screen or very close to another vertex, this was done with the purpose of giving a better user experience
35 |
36 | - In the edges section you can at first choose an initial vertex to add a new edge or delete an existing one, you can also directly touch on an edge value to be able to change it.
37 |
38 | If you chose a first vertex you should then choose a second vertex, when choosing it if there is no edge between the two chosen vertices, an edge of an average value will be added to the distance of the two vertices, if an edge already exists it will be eliminated.
39 |
40 | - if you choose the dfs or bfs option you will be prompted to choose an initial vertex for the algorithm to start.
41 |
42 | - If you choose the dijkstra algorithm, you must choose an initial vertex and a destination vertex.
43 |
44 | - The kruskal algorithm will work as soon as you press the minimum spanning tree button.
45 |
46 | ### Simple & advanced sort
47 | - You can at any time manipulate the array with the inputs section given below the screen.
48 |
49 | - After pressing on the algorithm you want, you can put it to work by pressing the play button, at any time you can reset the screen obtaining the state in which the input array is.
50 |
51 | ### Sieve of eratosthenes
52 | - Choosing the final number in the slider, you can start the algorithm whenever you want by pressing the play button, to reset everything press the reset button.
53 |
54 | ### Linear Algebra
55 |
56 | - By clicking on the method you want to use, depending on that method you will be asked for the required inputs, giving the calculate button you will be shown step by step how the result was reached.
57 |
58 | ## Screenshots
59 |
60 |
127 | );
128 | }
129 |
--------------------------------------------------------------------------------
/src/Pages/SieveOfEratosthenes/SketchSieveOfEratosthenes.js:
--------------------------------------------------------------------------------
1 | export default function sketchSieveOfEratosthenes(p)
2 | {
3 | let number=100;
4 | let play=false;
5 |
6 | let screenWidth, screenHeight;
7 |
8 | let colorRectangles=[];
9 |
10 | function ColorRectangle(x, y, width, height, color)
11 | {
12 | this.xRatio=x/screenWidth;
13 | this.yRatio=y/screenHeight;
14 | this.widthRatio=width/screenWidth;
15 | this.heightRatio=height/screenHeight;
16 | this.color=color;
17 |
18 |
19 | this.drawIt=function()
20 | {
21 | (this.color=="green")? p.fill(0, 255, 0, 90) : p.fill(255, 0, 0, 90);
22 |
23 | p.strokeWeight(.1);
24 | p.stroke("white");
25 | p.rect(this.xRatio*screenWidth, this.yRatio*screenHeight,
26 | this.widthRatio*screenWidth, this.heightRatio*screenHeight);
27 | }
28 | }
29 |
30 | function updateScreenProperties()
31 | {
32 | screenWidth=document.getElementById("sketchScreen").clientWidth;
33 | screenHeight=document.getElementById("sketchScreen").clientHeight;
34 | }
35 |
36 | function beginning()
37 | {
38 | drawTable(number);
39 | fillTableWithNumbers(number);
40 | }
41 |
42 | p.setup=function()
43 | {
44 | updateScreenProperties();
45 | p.createCanvas(screenWidth, screenHeight);
46 | beginning();
47 | }
48 |
49 | p.myCustomRedrawAccordingToNewPropsHandler=async function(props)
50 | {
51 | if(props.number!=number)
52 | {
53 | number=props.number;
54 | play=false;
55 | beginning();
56 | }
57 |
58 | else if(props.play!=play)
59 | {
60 | colorRectangles=[];
61 | play=props.play;
62 | beginning();
63 | if(play)
64 | {
65 | await drawFillSquares(number);
66 | }
67 | }
68 |
69 | }
70 |
71 | p.windowResized=function()
72 | {
73 | updateScreenProperties()
74 | p.resizeCanvas(screenWidth, screenHeight);
75 | beginning();
76 | colorRectangles.map(rectangle=>rectangle.drawIt())
77 | }
78 |
79 | function drawTable(number)
80 | {
81 | p.background(0);
82 | p.stroke(150);
83 | p.strokeWeight(1);
84 |
85 | let x=0;
86 | let y=0;
87 | const row_number=Math.floor(number/10)+1;
88 |
89 | for(; x
123 | {
124 | setTimeout(resolve, ms);
125 | });
126 | }
127 |
128 | async function drawFillSquares(number)
129 | {
130 | p.stroke(150);
131 | p.strokeWeight(1);
132 |
133 | let x=screenWidth/5;
134 | let y=0;
135 | const numberOfRows=Math.floor(number/10)+1;
136 |
137 | let actual_number=2;
138 | var isPrimeArr = new Array(number+1).fill(true);
139 |
140 | const selectedMiliseconds=90/number;
141 |
142 | for(x=0; x<10; x++)
143 | {
144 | for(y=0; y<=numberOfRows; y++)
145 | {
146 | if(isPrimeArr[actual_number])
147 | {
148 | colorRectangles.push(new ColorRectangle((screenWidth/10)*(actual_number%10), (screenHeight/numberOfRows)*(Math.floor(actual_number/10)), screenWidth/10, screenHeight/numberOfRows, "green"));
149 | colorRectangles[colorRectangles.length-1].drawIt();
150 |
151 | for(let z=actual_number+1; z<=number; z++)
152 | {
153 | if (z%actual_number==0 && isPrimeArr[z])
154 | {
155 | isPrimeArr[z]=false;
156 |
157 | colorRectangles.push(new ColorRectangle((screenWidth/10)*(z%10), (screenHeight/numberOfRows)*(Math.floor(z/10)), screenWidth/10, screenHeight/numberOfRows, "red"));
158 | colorRectangles[colorRectangles.length-1].drawIt();
159 | }
160 | await sleep(selectedMiliseconds/5);
161 | if(!play)
162 | return;
163 | }
164 | }
165 | actual_number++;
166 |
167 | await sleep(selectedMiliseconds);
168 | if(!play)
169 | return;
170 | }
171 | x=0;
172 | }
173 | }
174 | }
--------------------------------------------------------------------------------
/src/Tools/InformationOfAlgorithms&Presentation/InformationGraphs.js:
--------------------------------------------------------------------------------
1 | const information={
2 | dfs:
3 | {
4 | name: "Deep-First Search",
5 | information: "It is an algorithm that can be implemented both recursively and iteratively with a stack data structure.\n\nThe logic of this algorithm is to start with a vertex and mark it as visited, it will continuously look at the neighbors vertices and if any of those neighbors has not been visited, it will go to that neighbor immediately, leaving the current neighbour control process waiting.For this reason, in the iterative version, a stack data structure is used, because preference is given to the last added vertex.",
6 | pseudocode:
7 | {
8 | recursive: "DFS(V, ID) //V is an object, it contains vertices by IDs\n V.ID.viewed🠔true\n for neighbourId in V.ID.connections do\n if V.neighbourId.viewed=false then\n DFS(V, neighbourId)\n",
9 | iterative: "DFS(V, ID) //V is an object, it contains vertices by IDs\n stack🠔[V.ID]\n while stack.length≠0 do\n vertex🠔stack.pop()\n if vertex.viewed=false then\n vertex.viewed🠔true\n for newID in vertex.connections do\n stack.push(V.newID)\n"
10 | },
11 | },
12 |
13 | bfs:
14 | {
15 | name: "Breadth-First Search",
16 | information: "The logic of this algorithm is to start with a vertex and mark itas visited, then the neighbors vertices will be reviewed and if any of those neighbors has not been visited, it will be added to the waitinglist (queue) and it will be marked as visited, after analyzing the neighbors the algorithm will repeat the same process with the first element of the waiting list (queue), so it will continue until the waiting list (queue) is empty.",
17 | pseudocode:
18 | {
19 | recursive: "Traverse(queue)\n if queue.length=0\n return\n\n vertex🠔queue.dequeue()\n for newID in vertex.connections do\n if V.newID.viewed=false then\n V.newID.viewed🠔true\n stack.enqueue(V.newID)\n \n Traverse(queue)\n \nBFS(V, ID) //V is an object, it contains vertices by IDs\n V.ID.viewed🠔true\n queue🠔[V.ID]\n traverse(queue)\n",
20 | iterative: "BFS(V, ID) //V is an object, it contains vertices by IDs\n queue🠔[V.ID]\n V.ID.viewed🠔true\n while stack.length≠0 do\n vertex🠔queue.dequeue()\n for newID in vertex.connections do\n if V.newID.viewed=false then\n V.newID.viewed🠔true\n stack.enqueue(V.newID)",
21 | },
22 | },
23 |
24 | dijkstra:
25 | {
26 | name: "Dijkstra's Algorithm",
27 | information: "The dijkstra's algorithm starts from the desired vertex, accepting that the distance from the vertex from the beginning to all the others is infinite (meaning that there is no path) and to itself is zero, this information will be saved.\n\nIt will continuously look at all neighbors roads, if the sum of the distance from the current vertex (which is in the saved information) and the value of the road it is looking at is less than the currently known distance to that neighbor then it will update the value of the road.\n\n"+
28 | "The algorithm will continue with the other vertices, always giving priority to the closest one and will not return to the vertices already seen. For this same reason, a priority queue is usually implemented for vertices.\n\nThe algorithm due to always going to the most optimal in order to find the most optimal solution is considered as a greedy algorithm, also for this same reason it does not work with graphs that contain negative values.\n\nThe reason for this is because by always looking forthe most optimal value in each "+
29 | "situation, it can make the result not be the most optimal. The algorithm could work with negative value paths if whenever an update of the stored distance information occurs, the vertices (if they are not present) are added in the priority queue again, but when doing this the algorithm would not work in cycles containing negative paths, because the algorithm would never finish.\n\nThe algorithm due to always store all distances not only, it can find the most optimal route to one end point, it can find all the most optimal "+
30 | "routes to all remaining points. Due to this, the algorithm also serves to know if a graph is a connected graph or a disconnected graph.",
31 | pseudocode: "Dijkstra(V, ID) //V is an object, it contains vertices by IDs\n checkingVertices🠔V.copy()\n //only the memory references of the vertices are copied.\n for tempID in checkingVertices do\n V.tempID .prevID🠔NULL\n V.tempID.distance🠔INFINITY\n checkingVertices.ID🠔0\n\n while checkingVertices has attributes do\n actual🠔V.(getVertexIDWithMinDistance(checkingVertices))\n delete checkingVertices.(actual.ID) //Deleting attribute\n\n for neighbourID in actual.connections do\n distance🠔actual.distance+actual.costOfEdge(neighbourID)\n if distanceThe algorithm always focuses on the minimum, that is why the algorithm will be considered a greedy algorithm.",
38 | pseudocode:"findParent(parents, index)\n\tif index=parents[index] then\n\t\treturn index\n\treturn findParent(parents, parents[index])\n\nKruskal(edges, numberOfVertices) //edges=[..., [cost, initialIndex, destinyIndex]]\n\tSORT EDGES IN ASCENDING ORDER BY COSTS\n\tparents🠔[0, 1, ...., numberOfVertices-1]\n\toutput🠔[] //arraylist\n\t\n\twhile output.length≠numberOfVertices-1 do//the given graph is assumed to be connected\n\t\tedgeInfo🠔edges.dequeue()\n\t\tconst sourceParent🠔findParent(parents, edgeInfo[1])\n\t\tconst destinyParent🠔findParent(parents, edgeInfo[2])\n\t\t\n\t\tif sourceParent≠destinyParent then\n\t\t\tparents[sourceParent]🠔destinyParent\n\t\t\toutput.add(edgeInfo)"
39 | }
40 | };
41 |
42 | export default information;
--------------------------------------------------------------------------------
/static/js/3.0c919b85.chunk.js.map:
--------------------------------------------------------------------------------
1 | {"version":3,"sources":["../../../../Projectos/Algorithms Visualizer/react/node_modules/web-vitals/dist/web-vitals.js"],"names":["e","t","n","i","a","name","value","delta","entries","id","concat","Date","now","Math","floor","random","r","PerformanceObserver","supportedEntryTypes","includes","self","getEntries","map","observe","type","buffered","o","document","visibilityState","removeEventListener","addEventListener","c","persisted","u","WeakSet","Set","f","has","s","hadRecentInput","push","takeRecords","m","p","v","timeStamp","d","setTimeout","l","disconnect","startTime","add","performance","getEntriesByName","requestAnimationFrame","h","passive","capture","S","y","w","g","entryType","target","cancelable","processingStart","forEach","E","L","T","once","b","getEntriesByType","timing","max","navigationStart","responseStart","readyState"],"mappings":"gIAAA,+MAAIA,EAAEC,EAAEC,EAAEC,EAAEC,EAAE,SAASJ,EAAEC,GAAG,MAAM,CAACI,KAAKL,EAAEM,WAAM,IAASL,GAAG,EAAEA,EAAEM,MAAM,EAAEC,QAAQ,GAAGC,GAAG,MAAMC,OAAOC,KAAKC,MAAM,KAAKF,OAAOG,KAAKC,MAAM,cAAcD,KAAKE,UAAU,QAAQC,EAAE,SAAShB,EAAEC,GAAG,IAAI,GAAGgB,oBAAoBC,oBAAoBC,SAASnB,GAAG,CAAC,GAAG,gBAAgBA,KAAK,2BAA2BoB,MAAM,OAAO,IAAIlB,EAAE,IAAIe,qBAAqB,SAASjB,GAAG,OAAOA,EAAEqB,aAAaC,IAAIrB,MAAM,OAAOC,EAAEqB,QAAQ,CAACC,KAAKxB,EAAEyB,UAAS,IAAKvB,GAAG,MAAMF,MAAM0B,EAAE,SAAS1B,EAAEC,GAAG,IAAIC,EAAE,SAASA,EAAEC,GAAG,aAAaA,EAAEqB,MAAM,WAAWG,SAASC,kBAAkB5B,EAAEG,GAAGF,IAAI4B,oBAAoB,mBAAmB3B,GAAE,GAAI2B,oBAAoB,WAAW3B,GAAE,MAAO4B,iBAAiB,mBAAmB5B,GAAE,GAAI4B,iBAAiB,WAAW5B,GAAE,IAAK6B,EAAE,SAAS/B,GAAG8B,iBAAiB,YAAY,SAAS7B,GAAGA,EAAE+B,WAAWhC,EAAEC,MAAK,IAAKgC,EAAE,mBAAmBC,QAAQ,IAAIA,QAAQ,IAAIC,IAAIC,EAAE,SAASpC,EAAEC,EAAEC,GAAG,IAAIC,EAAE,OAAO,WAAWF,EAAEK,OAAO,IAAIJ,GAAG+B,EAAEI,IAAIpC,IAAI,WAAW0B,SAASC,mBAAmB3B,EAAEM,MAAMN,EAAEK,OAAOH,GAAG,IAAIF,EAAEM,YAAO,IAASJ,KAAKA,EAAEF,EAAEK,MAAMN,EAAEC,OAAOqC,EAAE,SAAStC,EAAEC,GAAG,IAAIC,EAAEC,EAAEC,EAAE,MAAM,GAAG6B,EAAE,SAASjC,GAAGA,EAAEuC,iBAAiBpC,EAAEG,OAAON,EAAEM,MAAMH,EAAEK,QAAQgC,KAAKxC,GAAGE,MAAMoC,EAAEtB,EAAE,eAAeiB,GAAGK,IAAIpC,EAAEkC,EAAEpC,EAAEG,EAAEF,GAAGyB,GAAG,WAAWY,EAAEG,cAAcnB,IAAIW,GAAG/B,OAAO6B,GAAG,WAAW5B,EAAEC,EAAE,MAAM,GAAGF,EAAEkC,EAAEpC,EAAEG,EAAEF,QAAQyC,GAAG,EAAEC,EAAE,WAAW,MAAM,WAAWhB,SAASC,gBAAgB,EAAE,KAAKgB,EAAE,WAAWlB,GAAG,SAAS1B,GAAG,IAAIC,EAAED,EAAE6C,UAAUH,EAAEzC,KAAI,IAAK6C,EAAE,WAAW,OAAOJ,EAAE,IAAIA,EAAEC,IAAIC,IAAIb,GAAG,WAAWgB,YAAY,WAAWL,EAAEC,IAAIC,MAAM,OAAO,CAAC,gBAAgB,OAAOF,KAAKM,EAAE,SAAShD,EAAEC,GAAG,IAAIC,EAAEC,EAAE2C,IAAIpB,EAAEtB,EAAE,OAAOkC,EAAE,SAAStC,GAAG,2BAA2BA,EAAEK,OAAOsC,GAAGA,EAAEM,aAAajD,EAAEkD,UAAU/C,EAAE0C,YAAYnB,EAAEpB,MAAMN,EAAEkD,UAAUxB,EAAElB,QAAQgC,KAAKxC,GAAGiC,EAAEkB,IAAIzB,GAAGxB,OAAOwC,EAAEU,YAAYC,iBAAiB,0BAA0B,GAAGV,EAAED,EAAE,KAAK1B,EAAE,QAAQsB,IAAII,GAAGC,KAAKzC,EAAEkC,EAAEpC,EAAE0B,EAAEzB,GAAGyC,GAAGJ,EAAEI,GAAGX,GAAG,SAAS5B,GAAGuB,EAAEtB,EAAE,OAAOF,EAAEkC,EAAEpC,EAAE0B,EAAEzB,GAAGqD,uBAAuB,WAAWA,uBAAuB,WAAW5B,EAAEpB,MAAM8C,YAAYxC,MAAMT,EAAE0C,UAAUZ,EAAEkB,IAAIzB,GAAGxB,eAAeqD,EAAE,CAACC,SAAQ,EAAGC,SAAQ,GAAIC,EAAE,IAAI/C,KAAKgD,EAAE,SAASxD,EAAEC,GAAGJ,IAAIA,EAAEI,EAAEH,EAAEE,EAAED,EAAE,IAAIS,KAAKiD,EAAE/B,qBAAqBgC,MAAMA,EAAE,WAAW,GAAG5D,GAAG,GAAGA,EAAEC,EAAEwD,EAAE,CAAC,IAAItD,EAAE,CAAC0D,UAAU,cAAczD,KAAKL,EAAEwB,KAAKuC,OAAO/D,EAAE+D,OAAOC,WAAWhE,EAAEgE,WAAWd,UAAUlD,EAAE6C,UAAUoB,gBAAgBjE,EAAE6C,UAAU5C,GAAGE,EAAE+D,SAAS,SAASlE,GAAGA,EAAEI,MAAMD,EAAE,KAAKgE,EAAE,SAASnE,GAAG,GAAGA,EAAEgE,WAAW,CAAC,IAAI/D,GAAGD,EAAE6C,UAAU,KAAK,IAAIlC,KAAKyC,YAAYxC,OAAOZ,EAAE6C,UAAU,eAAe7C,EAAEwB,KAAK,SAASxB,EAAEC,GAAG,IAAIC,EAAE,WAAWyD,EAAE3D,EAAEC,GAAGG,KAAKD,EAAE,WAAWC,KAAKA,EAAE,WAAWyB,oBAAoB,YAAY3B,EAAEqD,GAAG1B,oBAAoB,gBAAgB1B,EAAEoD,IAAIzB,iBAAiB,YAAY5B,EAAEqD,GAAGzB,iBAAiB,gBAAgB3B,EAAEoD,GAA9N,CAAkOtD,EAAED,GAAG2D,EAAE1D,EAAED,KAAK4D,EAAE,SAAS5D,GAAG,CAAC,YAAY,UAAU,aAAa,eAAekE,SAAS,SAASjE,GAAG,OAAOD,EAAEC,EAAEkE,EAAEZ,OAAOa,EAAE,SAASlE,EAAEoC,GAAG,IAAII,EAAEC,EAAEG,IAAIF,EAAExC,EAAE,OAAO4C,EAAE,SAAShD,GAAGA,EAAEkD,UAAUP,EAAEE,YAAYD,EAAEtC,MAAMN,EAAEiE,gBAAgBjE,EAAEkD,UAAUN,EAAEpC,QAAQgC,KAAKxC,GAAGiC,EAAEkB,IAAIP,GAAGF,MAAMa,EAAEvC,EAAE,cAAcgC,GAAGN,EAAEN,EAAElC,EAAE0C,EAAEN,GAAGiB,GAAG7B,GAAG,WAAW6B,EAAEd,cAAcnB,IAAI0B,GAAGO,EAAEN,gBAAe,GAAIM,GAAGxB,GAAG,WAAW,IAAIf,EAAE4B,EAAExC,EAAE,OAAOsC,EAAEN,EAAElC,EAAE0C,EAAEN,GAAGnC,EAAE,GAAGF,GAAG,EAAED,EAAE,KAAK4D,EAAE9B,kBAAkBd,EAAEgC,EAAE7C,EAAEqC,KAAKxB,GAAG6C,QAAQQ,EAAE,SAASrE,EAAEC,GAAG,IAAIC,EAAEC,EAAE2C,IAAIR,EAAElC,EAAE,OAAOsC,EAAE,SAAS1C,GAAG,IAAIC,EAAED,EAAEkD,UAAUjD,EAAEE,EAAE0C,YAAYP,EAAEhC,MAAML,EAAEqC,EAAE9B,QAAQgC,KAAKxC,IAAIE,KAAKyC,EAAE3B,EAAE,2BAA2B0B,GAAG,GAAGC,EAAE,CAACzC,EAAEkC,EAAEpC,EAAEsC,EAAErC,GAAG,IAAI2C,EAAE,WAAWX,EAAEI,IAAIC,KAAKK,EAAEF,cAAcnB,IAAIoB,GAAGC,EAAEM,aAAahB,EAAEkB,IAAIb,GAAGpC,MAAM,CAAC,UAAU,SAASgE,SAAS,SAASlE,GAAG8B,iBAAiB9B,EAAE4C,EAAE,CAAC0B,MAAK,EAAGb,SAAQ,OAAQ/B,EAAEkB,GAAE,GAAIb,GAAG,SAAS5B,GAAGmC,EAAElC,EAAE,OAAOF,EAAEkC,EAAEpC,EAAEsC,EAAErC,GAAGqD,uBAAuB,WAAWA,uBAAuB,WAAWhB,EAAEhC,MAAM8C,YAAYxC,MAAMT,EAAE0C,UAAUZ,EAAEkB,IAAIb,GAAGpC,eAAeqE,EAAE,SAASvE,GAAG,IAAIC,EAAEC,EAAEE,EAAE,QAAQH,EAAE,WAAW,IAAI,IAAIA,EAAEmD,YAAYoB,iBAAiB,cAAc,IAAI,WAAW,IAAIxE,EAAEoD,YAAYqB,OAAOxE,EAAE,CAAC6D,UAAU,aAAaZ,UAAU,GAAG,IAAI,IAAIhD,KAAKF,EAAE,oBAAoBE,GAAG,WAAWA,IAAID,EAAEC,GAAGW,KAAK6D,IAAI1E,EAAEE,GAAGF,EAAE2E,gBAAgB,IAAI,OAAO1E,EAAhL,GAAqL,GAAGC,EAAEI,MAAMJ,EAAEK,MAAMN,EAAE2E,cAAc1E,EAAEI,MAAM,EAAE,OAAOJ,EAAEM,QAAQ,CAACP,GAAGD,EAAEE,GAAG,MAAMF,MAAM,aAAa2B,SAASkD,WAAW9B,WAAW9C,EAAE,GAAG6B,iBAAiB,WAAW7B","file":"static/js/3.0c919b85.chunk.js","sourcesContent":["var e,t,n,i,a=function(e,t){return{name:e,value:void 0===t?-1:t,delta:0,entries:[],id:\"v1-\".concat(Date.now(),\"-\").concat(Math.floor(8999999999999*Math.random())+1e12)}},r=function(e,t){try{if(PerformanceObserver.supportedEntryTypes.includes(e)){if(\"first-input\"===e&&!(\"PerformanceEventTiming\"in self))return;var n=new PerformanceObserver((function(e){return e.getEntries().map(t)}));return n.observe({type:e,buffered:!0}),n}}catch(e){}},o=function(e,t){var n=function n(i){\"pagehide\"!==i.type&&\"hidden\"!==document.visibilityState||(e(i),t&&(removeEventListener(\"visibilitychange\",n,!0),removeEventListener(\"pagehide\",n,!0)))};addEventListener(\"visibilitychange\",n,!0),addEventListener(\"pagehide\",n,!0)},c=function(e){addEventListener(\"pageshow\",(function(t){t.persisted&&e(t)}),!0)},u=\"function\"==typeof WeakSet?new WeakSet:new Set,f=function(e,t,n){var i;return function(){t.value>=0&&(n||u.has(t)||\"hidden\"===document.visibilityState)&&(t.delta=t.value-(i||0),(t.delta||void 0===i)&&(i=t.value,e(t)))}},s=function(e,t){var n,i=a(\"CLS\",0),u=function(e){e.hadRecentInput||(i.value+=e.value,i.entries.push(e),n())},s=r(\"layout-shift\",u);s&&(n=f(e,i,t),o((function(){s.takeRecords().map(u),n()})),c((function(){i=a(\"CLS\",0),n=f(e,i,t)})))},m=-1,p=function(){return\"hidden\"===document.visibilityState?0:1/0},v=function(){o((function(e){var t=e.timeStamp;m=t}),!0)},d=function(){return m<0&&(m=p(),v(),c((function(){setTimeout((function(){m=p(),v()}),0)}))),{get timeStamp(){return m}}},l=function(e,t){var n,i=d(),o=a(\"FCP\"),s=function(e){\"first-contentful-paint\"===e.name&&(p&&p.disconnect(),e.startTime=0&&t1e12?new Date:performance.now())-e.timeStamp;\"pointerdown\"==e.type?function(e,t){var n=function(){y(e,t),a()},i=function(){a()},a=function(){removeEventListener(\"pointerup\",n,h),removeEventListener(\"pointercancel\",i,h)};addEventListener(\"pointerup\",n,h),addEventListener(\"pointercancel\",i,h)}(t,e):y(t,e)}},w=function(e){[\"mousedown\",\"keydown\",\"touchstart\",\"pointerdown\"].forEach((function(t){return e(t,E,h)}))},L=function(n,s){var m,p=d(),v=a(\"FID\"),l=function(e){e.startTimethis.maxElement)
32 | this.maxElement=array[x];
33 |
34 | this.heightConstant=(screenHeight/partitionScreenRatio-80)/this.maxElement;
35 |
36 | this.isThereAnyDestination=false;
37 |
38 | this.actualXCoordinate=this.widthOfSpace*(elementIndex+1)+this.widthOfRectangle*elementIndex;
39 | this.rectangleHeight=this.heightConstant*array[elementIndex];
40 | this.actualYCoordinate=screenHeight/partitionScreenRatio-this.rectangleHeight;
41 | }
42 |
43 | this.updateDestinyCoordinates=function(isTheDestinationBelow, destinationIndex)
44 | {
45 | this.isThereAnyDestination=true;
46 |
47 | this.toXCoordinate=this.widthOfSpace*(destinationIndex+1)+this.widthOfRectangle*destinationIndex;
48 |
49 | if(isTheDestinationBelow)
50 | {
51 | this.toYCoordinate=partitionScreenRatio*screenHeight/partitionScreenRatio-this.rectangleHeight;
52 | this.position="Down";
53 | }
54 |
55 | else
56 | {
57 | this.toYCoordinate=screenHeight/partitionScreenRatio-this.rectangleHeight;
58 | this.position="Up";
59 | }
60 |
61 | this.dx=(this.toXCoordinate-this.actualXCoordinate)/framePerSecond;
62 | this.dy=(this.toYCoordinate-this.actualYCoordinate)/framePerSecond;
63 | }
64 |
65 | this.display=function()
66 | {
67 | if(this.isThereAnyDestination)
68 | {
69 | if( (this.actualYCoordinate>=this.toYCoordinate && this.position=="Down") ||
70 | (this.actualYCoordinate<=this.toYCoordinate && this.position=="Up") )
71 | {
72 | this.isThereAnyDestination=false;
73 | }
74 |
75 | else
76 | {
77 | this.actualXCoordinate+=this.dx;
78 | this.actualYCoordinate+=this.dy;
79 |
80 | p.fill("red");
81 | p.rect(this.actualXCoordinate, this.actualYCoordinate, this.widthOfRectangle, this.rectangleHeight);
82 | }
83 | }
84 |
85 | else
86 | {
87 | p.fill("white");
88 | p.rect(this.actualXCoordinate, this.actualYCoordinate, this.widthOfRectangle, this.rectangleHeight);
89 | }
90 | }
91 | }
92 |
93 | async function playSort()
94 | {
95 | switch(sortMode)
96 | {
97 | case "Quick":
98 | await quickSort(0, array.length);
99 | break;
100 |
101 | case "Merge":
102 | await mergeSort(0, array.length);
103 | break;
104 | }
105 | }
106 |
107 | p.setup=function()
108 | {
109 | updateScreenProperties();
110 | p.createCanvas(screenWidth, screenHeight);
111 | resetScreen();
112 | }
113 |
114 |
115 | p.draw=function()
116 | {
117 | p.background(0);
118 | for(let x=0; x
127 | {
128 | setTimeout(resolve, ms);
129 | });
130 | }
131 |
132 | function updateInputCellValue(index, newValue)
133 | {
134 | try
135 | {
136 | document.getElementById("elementWithIndex"+index.toString()).value = newValue;
137 | }
138 | catch(e){}
139 | }
140 |
141 | async function mergeSort(starterIndex, size)
142 | {
143 | if (size < 2)
144 | return;
145 |
146 | const half=Math.floor(size/2);
147 |
148 | await mergeSort(starterIndex, half);
149 | await mergeSort(half+starterIndex, size-half);
150 |
151 | let index=0, left = 0, right = half;
152 | const arrayPartitionElementsOrdered = [];
153 | const rectangleArrayPartitionElementsOrdered=[];
154 |
155 | while (leftarray[x])
233 | {
234 | //real swap
235 | temp=array[x];
236 | array[x]=array[position];
237 | array[position]=temp;
238 |
239 | //visual swap
240 | rectangleArray[x].updateDestinyCoordinates(true, x);
241 | rectangleArray[position].updateDestinyCoordinates(true, position);
242 | await sleep(600);
243 | rectangleArray[x].updateDestinyCoordinates(false, position);
244 | rectangleArray[position].updateDestinyCoordinates(false, x);
245 | await sleep(400);
246 | temp=rectangleArray[x];
247 | rectangleArray[x]=rectangleArray[position];
248 | rectangleArray[position]=temp;
249 | updateInputCellValue(x, array[x]);
250 | updateInputCellValue(position, array[position]);
251 |
252 | position++;
253 | }
254 | }
255 |
256 | if(!play)
257 | return;
258 |
259 | //real swap
260 | temp=array[starterIndex];
261 | array[starterIndex]=array[position-1];
262 | array[position-1]=temp;
263 |
264 | //visual swap
265 | rectangleArray[starterIndex].updateDestinyCoordinates(true, starterIndex);
266 | rectangleArray[position-1].updateDestinyCoordinates(true, position-1);
267 | await sleep(600);
268 | rectangleArray[starterIndex].updateDestinyCoordinates(false, position-1);
269 | rectangleArray[position-1].updateDestinyCoordinates(false, starterIndex);
270 | await sleep(400);
271 | temp=rectangleArray[starterIndex];
272 | rectangleArray[starterIndex]=rectangleArray[position-1];
273 | rectangleArray[position-1]=temp;
274 | updateInputCellValue(starterIndex, array[starterIndex]);
275 | updateInputCellValue(position-1, array[position-1]);
276 |
277 | position-=starterIndex;
278 | await quickSort(starterIndex, position-1);
279 | await quickSort(starterIndex+position, size-position);
280 | }
281 |
282 | function resetScreen()
283 | {
284 | p.fill(0);
285 | p.rect(0, 0, screenWidth, screenHeight);
286 | play=false;
287 |
288 | rectangleArray=[];
289 | for(let x=0; x=0)
325 | {
326 | array[props.indexChanged]=parseInt(document.getElementById("elementWithIndex"+props.indexChanged.toString()).value);
327 | props.setIndexChanged(-1);
328 | props.setPlay(false);
329 | resetScreen();
330 | }
331 |
332 | else if(props.play!=play)
333 | {
334 | play=props.play;
335 |
336 | if(play)
337 | await playSort();
338 |
339 | else
340 | resetScreen();
341 |
342 | props.setPlay(false);
343 | }
344 | }
345 | }
--------------------------------------------------------------------------------
/src/Pages/SortAlgorithms/SimpleSortAlgorithms/SimpleSortAlgorithmsSketch.js:
--------------------------------------------------------------------------------
1 | export default function SimpleSortAlgorithmsSketch(p)
2 | {
3 | let screenWidth;
4 | let screenHeight;
5 |
6 | let array=[3, 6, 1, 2, 9, 15, 32, 30, 29, 28, 25, 22, 21, 2]; //minimum := 3, maximum :=30
7 |
8 | let numberOfSpaces, widthOfRectangle,
9 | widthOfSpace, maxElement,
10 | heightConstant;
11 |
12 | let velocity=100;
13 |
14 | let sortMode="Bubble";
15 |
16 | let play=false;
17 |
18 | function updateScreenProperties()
19 | {
20 | screenWidth=document.getElementById("sketchScreen").clientWidth;
21 | screenHeight=document.getElementById("sketchScreen").clientHeight;
22 | }
23 |
24 | p.setup=function()
25 | {
26 | updateScreenProperties();
27 | p.createCanvas(screenWidth, screenHeight);
28 | p.background(0);
29 | drawRectangles();
30 | }
31 |
32 | function findMax()
33 | {
34 | maxElement=array[0];
35 | for(let x=1; xmaxElement)
38 | maxElement=array[x];
39 | }
40 | }
41 |
42 | function findCoordinatesAndHeightOfTriangle(elementIndex)
43 | {
44 | const xCoordinate=widthOfSpace*(elementIndex+1)+widthOfRectangle*elementIndex;
45 | const _height=heightConstant*array[elementIndex];
46 | const yCoordinate=screenHeight-_height;
47 |
48 | return [xCoordinate, yCoordinate, _height];
49 | }
50 |
51 | function drawRectangleWithColor(color, xCoordinate, yCoordinate, _height)
52 | {
53 | switch(color)
54 | {
55 | case "red":
56 | p.fill("red");
57 | break;
58 |
59 | case "green":
60 | p.fill("green");
61 | break;
62 |
63 | case "orange":
64 | p.fill("orange");
65 | break;
66 |
67 | case "black":
68 | p.fill("black");
69 | break;
70 |
71 | default:
72 | p.fill("white");
73 | }
74 | p.rect(xCoordinate, yCoordinate, widthOfRectangle, _height);
75 | p.fill("white");
76 | }
77 |
78 | function drawRectangles()
79 | {
80 | numberOfSpaces=array.length+1;
81 | widthOfRectangle=screenWidth/numberOfSpaces;
82 | widthOfSpace=widthOfRectangle/numberOfSpaces;
83 |
84 | findMax();
85 | heightConstant=(screenHeight-80)/maxElement;
86 |
87 | p.fill(255);
88 | for(let x=0; x
98 | {
99 | setTimeout(resolve, ms);
100 | });
101 | }
102 |
103 | function updateInputCellValue(index, newValue)
104 | {
105 | try
106 | {
107 | document.getElementById("elementWithIndex"+index.toString()).value = newValue;
108 | }
109 | catch(e){}
110 | }
111 |
112 | async function bubbleSort()
113 | {
114 | let swapHapenned=true;
115 | while(swapHapenned)
116 | {
117 | swapHapenned=false;
118 | const end=array.length-1;
119 | for(let x=0; xarray[x+1])
138 | {
139 | drawRectangleWithColor("red", backXCoordinate, backYCoordinate, backHeight);
140 | drawRectangleWithColor("red", frontXCoordinate, frontYCoordinate, frontHeight);
141 |
142 | await sleep(velocity);
143 | if(!play)
144 | return;
145 |
146 | drawRectangleWithColor("black", backXCoordinate, backYCoordinate, backHeight);
147 | drawRectangleWithColor("black", frontXCoordinate, frontYCoordinate, frontHeight);
148 |
149 | const temp=array[x+1];
150 | array[x+1]=array[x];
151 | updateInputCellValue(x+1, array[x+1]);
152 | array[x]=temp;
153 | updateInputCellValue(x, array[x]);
154 | swapHapenned=true;
155 |
156 | [backXCoordinate, backYCoordinate, backHeight]=
157 | findCoordinatesAndHeightOfTriangle(x);
158 | [frontXCoordinate, frontYCoordinate, frontHeight]=
159 | findCoordinatesAndHeightOfTriangle(x+1);
160 |
161 | drawRectangleWithColor("orange", backXCoordinate, backYCoordinate, backHeight);
162 | drawRectangleWithColor("orange", frontXCoordinate, frontYCoordinate, frontHeight);
163 |
164 | await sleep(velocity);
165 | if(!play)
166 | return;
167 |
168 | drawRectangleWithColor("white", backXCoordinate, backYCoordinate, backHeight);
169 | drawRectangleWithColor("white", frontXCoordinate, frontYCoordinate, frontHeight);
170 | }
171 | }
172 | }
173 | }
174 |
175 | async function selectionSort()
176 | {
177 | for(let x=0; xkey && y>=0; y--)
256 | {
257 | [backXCoordinate, backYCoordinate, backHeight]=
258 | findCoordinatesAndHeightOfTriangle(y);
259 | [middleXCoordinate, middleYCoordinate, middleHeight]=
260 | findCoordinatesAndHeightOfTriangle(y+1);
261 |
262 | drawRectangleWithColor("red", backXCoordinate, backYCoordinate, backHeight);
263 | drawRectangleWithColor("red", middleXCoordinate, middleYCoordinate, middleHeight);
264 | await sleep(velocity);
265 | if(!play)
266 | return;
267 |
268 | drawRectangleWithColor("black", backXCoordinate, backYCoordinate, backHeight);
269 | drawRectangleWithColor("black", middleXCoordinate, middleYCoordinate, middleHeight);
270 |
271 | array[y+1]=array[y];
272 | updateInputCellValue(y+1, array[y+1]);
273 |
274 | [backXCoordinate, backYCoordinate, backHeight]=
275 | findCoordinatesAndHeightOfTriangle(y+1);
276 | [middleXCoordinate, middleYCoordinate, middleHeight]=
277 | findCoordinatesAndHeightOfTriangle(y);
278 |
279 | drawRectangleWithColor("orange", backXCoordinate, backYCoordinate, backHeight);
280 | drawRectangleWithColor("orange", middleXCoordinate, middleYCoordinate, middleHeight);
281 | await sleep(velocity);
282 | if(!play)
283 | return;
284 |
285 | drawRectangleWithColor("white", backXCoordinate, backYCoordinate, backHeight);
286 | drawRectangleWithColor("white", middleXCoordinate, middleYCoordinate, middleHeight);
287 | }
288 |
289 | [backXCoordinate, backYCoordinate, backHeight]=
290 | findCoordinatesAndHeightOfTriangle(y+1);
291 | drawRectangleWithColor("black", backXCoordinate, backYCoordinate, backHeight);
292 |
293 | array[y + 1] = key;
294 | updateInputCellValue(y+1, array[y+1]);
295 |
296 | [backXCoordinate, backYCoordinate, backHeight]=
297 | findCoordinatesAndHeightOfTriangle(y+1);
298 | drawRectangleWithColor("orange", backXCoordinate, backYCoordinate, backHeight);
299 |
300 | await sleep(velocity);
301 | if(!play)
302 | return;
303 |
304 | drawRectangleWithColor("white", backXCoordinate, backYCoordinate, backHeight);
305 | }
306 | }
307 |
308 | async function playSort()
309 | {
310 | switch(sortMode)
311 | {
312 | case "Bubble":
313 | await bubbleSort();
314 | break;
315 |
316 | case "Insertion":
317 | await insertionSort();
318 | break;
319 |
320 | case "Selection":
321 | await selectionSort();
322 | break;
323 | }
324 | }
325 |
326 | function resetScreen()
327 | {
328 | p.fill(0);
329 | p.rect(0, 0, screenWidth, screenHeight);
330 | drawRectangles();
331 | }
332 |
333 | p.windowResized=function()
334 | {
335 | updateScreenProperties();
336 | p.resizeCanvas(screenWidth, screenHeight);
337 | resetScreen();
338 | }
339 |
340 | p.myCustomRedrawAccordingToNewPropsHandler=async function(props)
341 | {
342 | if(props.sortMode!=sortMode)
343 | {
344 | sortMode=props.sortMode;
345 | props.setPlay(false);
346 | resetScreen();
347 | }
348 |
349 | else if(props.array.length!=array.length)
350 | {
351 | if(props.array.length=0)
361 | {
362 | array[props.indexChanged]=parseInt(document.getElementById("elementWithIndex"+props.indexChanged.toString()).value);
363 | props.setPlay(false);
364 | resetScreen();
365 | props.setIndexChanged(-1);
366 | }
367 |
368 | else if(props.play!=play)
369 | {
370 | play=props.play;
371 |
372 | if(play)
373 | await playSort();
374 |
375 | else
376 | resetScreen();
377 |
378 | props.setPlay(false);
379 | }
380 |
381 | else if(100/props.velocity!=velocity)
382 | {
383 | velocity=100/props.velocity;
384 | }
385 | }
386 | }
387 |
388 |
--------------------------------------------------------------------------------
/src/Pages/Graphs/SketchGraphs.js:
--------------------------------------------------------------------------------
1 | export default function SketchGraphs(p)
2 | {
3 | let screenWidth;
4 | let screenHeight;
5 | let vertexRatio;
6 |
7 | const vertices={}; //{... id: new Vertex(...) ...}
8 | let uniqueVertexID=1;
9 | let velocity=1;
10 | const mode={type:"vertex", startID:-1, destinyID:-1, algorithm: "",
11 | pathCost: 0, displayValues:true, changingValue: false};
12 |
13 | let input, button;
14 |
15 | function updateScreenProperties()
16 | {
17 | screenWidth=document.getElementById("graphsSketchScreen").clientWidth;
18 | screenHeight=document.getElementById("graphsSketchScreen").clientHeight;
19 | vertexRatio=0.6*screenWidth/50 + screenHeight/25;
20 | }
21 |
22 | function notifyToUser()
23 | {
24 | p.fill("grey")
25 | p.stroke("grey");
26 | p.rect(0, 0, screenWidth, screenHeight/8);
27 |
28 | p.textAlign(p.CENTER);
29 | p.textSize((p.width+p.height)/60);
30 | p.strokeWeight(3);
31 | p.fill("white")
32 | p.stroke("black");
33 |
34 | const[x, y]=[screenWidth/2, screenHeight/20];
35 | switch(mode.type)
36 | {
37 | case "vertex":
38 | p.text("-Click on an empty place to add a vertex.\n-Press on a vertex to delete it.", x, y);
39 | break;
40 |
41 | case "edgeFirst":
42 | p.text("-Select a first vertex to create or delete an edge.\n-Select an edge value to change it.", x, y);
43 | break;
44 |
45 | case "edgeSecond":
46 | p.text("-Select a second vertex to create or delete an edge.", x, y);
47 | break;
48 |
49 | case "changingValue":
50 | drawLoopState("off");
51 | p.fill("orange");
52 | p.stroke("orange");
53 | p.rect(0, 0, screenWidth, screenHeight/8);
54 |
55 | p.fill("white")
56 | p.stroke("black");
57 | p.text(`-Vertex ${mode.startID} ➡ vertex ${mode.destinyID}, enter a new positive value:`, x, y);
58 |
59 | if(!input)
60 | {
61 | input = p.createInput();
62 | button = p.createButton("");
63 | }
64 |
65 | input.size(screenWidth/8, screenHeight/35)
66 | input.position(3*screenWidth/8.2, screenHeight/16);
67 |
68 | button.size(screenWidth/16, screenHeight/23)
69 | button.position(screenWidth/2, screenHeight/16);
70 |
71 | let action=function()
72 | {
73 | const value=parseInt(input.value());
74 | if(!isNaN(value) && value>=0)
75 | {
76 | vertices[mode.startID].changeEdgeValue(mode.destinyID, value);
77 | vertices[mode.destinyID].changeEdgeValue(mode.startID, value);
78 | }
79 |
80 | input.remove();
81 | button.remove();
82 | input=null;
83 | button=null;
84 | mode.type="edgeFirst";
85 | drawLoopState("on");
86 | };
87 | button.mousePressed(action);
88 |
89 | break;
90 |
91 | case "dfs":
92 | p.textLeading(y);
93 | p.text(`${mode.algorithm}\n-Select an initial vertex.`, x, y);
94 | break;
95 |
96 | case "bfs":
97 | p.textLeading(y);
98 | p.text(`${mode.algorithm}\n-Select an initial vertex.`, x, y);
99 | break;
100 |
101 | case "dijkstra1":
102 | p.textLeading(y);
103 | p.text(`${mode.algorithm}\n-Select an initial vertex.`, x, y);
104 | break;
105 |
106 | case "dijkstra2":
107 | p.textLeading(y);
108 | p.text(`${mode.algorithm}\n-Select a destiny vertex.`, x, y);
109 | break;
110 |
111 | case "running":
112 | p.fill("green")
113 | p.stroke("green");
114 | p.rect(0, 0, screenWidth, screenHeight/8);
115 |
116 | p.fill("white")
117 | p.stroke("black");
118 | p.textLeading(y);
119 | p.text(`${mode.algorithm}\nrunning...`, x, y);
120 | break;
121 |
122 | case "cost":
123 | p.fill("green");
124 | p.stroke("green");
125 | p.rect(0, 0, screenWidth, screenHeight/8);
126 |
127 | p.fill("white")
128 | p.stroke("black");
129 | p.text(`Cost of path: ${mode.pathCost} `, x, y);
130 | break;
131 |
132 | case "noPath":
133 | p.fill("red");
134 | p.stroke("red");
135 | p.rect(0, 0, screenWidth, screenHeight/8);
136 |
137 | p.fill("white")
138 | p.stroke("black");
139 | p.text(`No path from vertex ${vertices[mode.startID].ID} to vertex ${vertices[mode.destinyID].ID}...`, x, y);
140 | break;
141 |
142 | case "noMst":
143 | p.fill("red");
144 | p.stroke("red");
145 | p.rect(0, 0, screenWidth, screenHeight/8);
146 |
147 | p.fill("white")
148 | p.stroke("black");
149 | p.text("The graph is disconnected...", x, y);
150 | break;
151 | }
152 | }
153 |
154 | function drawLoopState(state)
155 | {
156 | if(state=="off")
157 | p.noLoop();
158 |
159 | else
160 | {
161 | for(let ID in vertices)
162 | vertices[ID].color="grey";
163 | p.loop();
164 | }
165 | }
166 |
167 | async function runAlgorithm()
168 | {
169 | if(p.isLooping())
170 | {
171 | let tempModeType=mode.type;
172 | mode.type="running";
173 | notifyToUser();
174 | drawLoopState("off");
175 |
176 | switch(mode.algorithm)
177 | {
178 | case "Deep-first search":
179 | await dfs(mode.startID, mode.startID);
180 | break;
181 |
182 | case "Breadth-first search":
183 | await bfs(mode.startID);
184 | break;
185 |
186 | case "Dijkstra's algorithm":
187 | tempModeType="dijkstra1";
188 | await dijkstra(mode.startID, mode.destinyID);
189 | break;
190 |
191 | case "Kruskal's algorithm":
192 | await kruskal();
193 | break;
194 | }
195 |
196 | await sleep(1500);
197 | mode.type=tempModeType;
198 | notifyToUser();
199 | drawLoopState("on");
200 | }
201 | }
202 |
203 | function euclideanDistance(x1, y1, x2, y2)
204 | {
205 | return Math.round(Math.sqrt( Math.pow(x1-x2, 2)+Math.pow(y1-y2, 2) ));
206 | }
207 |
208 | function Vertex(x, y)
209 | {
210 | this.ID=uniqueVertexID++;
211 | this.digitsOfID=Math.floor(Math.log10(this.ID))+1;
212 |
213 | this.xRatio=x/screenWidth;
214 | this.yRatio=y/screenHeight;
215 |
216 | this.color="grey";
217 |
218 | this.connectedIDsAndCosts={}; //{..., ID: cost, ....}
219 |
220 | this.displayVertex=function()
221 | {
222 | try
223 | {
224 | p.strokeWeight(2);
225 | p.stroke("grey");
226 | p.fill(this.color);
227 | p.ellipse(this.xRatio*screenWidth, this.yRatio*screenHeight, vertexRatio, vertexRatio);
228 |
229 | p.strokeWeight(2);
230 | p.fill("white")
231 | p.stroke("black");
232 | p.textSize((screenHeight+screenWidth)/70 - this.digitsOfID + 1);
233 | p.text(this.ID,
234 | this.xRatio*screenWidth-vertexRatio/20 - (screenWidth*1/1500)*(this.digitsOfID-1),
235 | this.yRatio*screenHeight+vertexRatio/5 - 2*(this.digitsOfID-1));
236 | }
237 | catch(e){}
238 | }
239 |
240 | this.displayEdges=function()
241 | {
242 | for(let ID in this.connectedIDsAndCosts)
243 | {
244 | try
245 | {
246 | const otherVertex=vertices[ID];
247 |
248 | p.strokeWeight(1.5);
249 |
250 | if(otherVertex.color!="orange" && this.color!="grey")
251 | p.stroke(otherVertex.color);
252 | else
253 | p.stroke(this.color);
254 |
255 | const [x1, y1]=[this.xRatio*screenWidth, this.yRatio*screenHeight];
256 | const [x2, y2]=[otherVertex.xRatio*screenWidth, otherVertex.yRatio*screenHeight];
257 | p.line(x1, y1, x2, y2);
258 |
259 | if(mode.displayValues)
260 | {
261 | p.strokeWeight(4);
262 | p.fill("white")
263 | p.stroke("black");
264 | p.textSize((p.width+p.height)/75);
265 | const distance=this.connectedIDsAndCosts[ID];
266 | p.text(distance, x1+(x2-x1)/2, y1+(y2-y1)/2);
267 | }
268 |
269 | this.displayVertex();
270 | otherVertex.displayVertex();
271 | }
272 | catch(e){}
273 | }
274 | }
275 |
276 | this.changeVertexColor=async function(color)
277 | {
278 | this.color="orange";
279 | this.displayVertex();
280 | await sleep(500/velocity);
281 | this.color=color;
282 | this.displayVertex();
283 | }
284 |
285 | this.isConnectedWithThatVertex=function(ID)
286 | {
287 | return this.connectedIDsAndCosts.hasOwnProperty(ID);
288 | }
289 |
290 | this.deleteEdgeWithThatVertex=function(ID)
291 | {
292 | if(this.isConnectedWithThatVertex(ID))
293 | {
294 | delete this.connectedIDsAndCosts[ID];
295 | delete vertices[ID].connectedIDsAndCosts[this.ID];
296 | }
297 | }
298 |
299 | this.addEdgeToVertex=function(ID) //Save in both parts for animations.
300 | {
301 | const vertex=vertices[ID];
302 |
303 | const [x1, y1]=[this.xRatio*screenWidth, this.yRatio*screenHeight];
304 | const [x2, y2]=[vertex.xRatio*screenWidth, vertex.yRatio*screenHeight];
305 | const distance=Math.floor(euclideanDistance(x1, y1, x2, y2)/10);
306 |
307 | vertex.connectedIDsAndCosts[this.ID]= distance;
308 | this.connectedIDsAndCosts[ID]=distance;
309 | }
310 |
311 | this.changeEdgeColor=function(vertexID, edgeColor)
312 | {
313 | if(this.isConnectedWithThatVertex(vertexID))
314 | {
315 | const [x1, y1]=[this.xRatio*screenWidth, this.yRatio*screenHeight];
316 | const otherVertex=vertices[vertexID];
317 | const [x2, y2]=[otherVertex.xRatio*screenWidth, otherVertex.yRatio*screenHeight];
318 | p.strokeWeight(3);
319 | p.stroke(edgeColor);
320 | p.line(x1, y1, x2, y2);
321 | if(mode.displayValues)
322 | {
323 | p.strokeWeight(4);
324 | p.fill("white");
325 | p.stroke(edgeColor);
326 | p.textSize((p.width+p.height)/75);
327 | const distance=this.connectedIDsAndCosts[vertexID];
328 | p.text(distance, x1+(x2-x1)/2, y1+(y2-y1)/2);
329 | }
330 | vertices[vertexID].displayVertex();
331 | this.displayVertex();
332 | }
333 | }
334 |
335 | this.changeEdgeValue=function(ID, value)
336 | {
337 | if(this.isConnectedWithThatVertex(ID))
338 | {
339 | this.connectedIDsAndCosts[ID]=value;
340 | vertices[ID].connectedIDsAndCosts[this.ID]=value;
341 | }
342 | }
343 | }
344 |
345 | function getRandomCoordinate(axis)
346 | {
347 | if(axis=="x")
348 | return p.random(vertexRatio, screenWidth-vertexRatio);
349 | return p.random(screenHeight/8+vertexRatio, screenHeight-vertexRatio);
350 | }
351 |
352 | p.setup=function()
353 | {
354 | updateScreenProperties();
355 | p.createCanvas(screenWidth, screenHeight);
356 |
357 | vertices[1]=new Vertex(getRandomCoordinate("x"), getRandomCoordinate("y"));
358 | vertices[2]=new Vertex(getRandomCoordinate("x"), getRandomCoordinate("y"));
359 | vertices[3]=new Vertex(getRandomCoordinate("x"), getRandomCoordinate("y"));
360 | vertices[4]=new Vertex(getRandomCoordinate("x"), getRandomCoordinate("y"));
361 |
362 | vertices[1].connectedIDsAndCosts[2]=10;
363 | vertices[1].connectedIDsAndCosts[4]=5;
364 | vertices[2].connectedIDsAndCosts[1]=10;
365 | vertices[2].connectedIDsAndCosts[3]=3;
366 | vertices[2].connectedIDsAndCosts[4]=24;
367 | vertices[3].connectedIDsAndCosts[4]=9;
368 | vertices[3].connectedIDsAndCosts[2]=3;
369 | vertices[4].connectedIDsAndCosts[2]=24;
370 | vertices[4].connectedIDsAndCosts[1]=5;
371 | vertices[4].connectedIDsAndCosts[3]=9;
372 | }
373 |
374 | p.draw=function()
375 | {
376 | p.background("black");
377 | for(let ID in vertices)
378 | {
379 | vertices[ID].displayVertex();
380 | vertices[ID].displayEdges();
381 | notifyToUser();
382 | }
383 | }
384 |
385 | p.mouseClicked=async function()
386 | {
387 | if(p.isLooping())
388 | {
389 | let clickedID=-1;
390 |
391 | if(mode.type.includes("edge"))
392 | {
393 | for(let ID in vertices)
394 | {
395 | if(euclideanDistance(p.mouseX, p.mouseY,
396 | vertices[ID].xRatio*screenWidth, vertices[ID].yRatio*screenHeight) <= vertexRatio)
397 | {
398 | clickedID=ID;
399 | break;
400 | }
401 | }
402 |
403 | if(clickedID>=0)
404 | {
405 | if(mode.type=="edgeFirst")
406 | {
407 | mode.type="edgeSecond";
408 | mode.startID=clickedID;
409 | }
410 |
411 | else
412 | {
413 | mode.destinyID=clickedID;
414 |
415 | if(vertices[mode.startID].isConnectedWithThatVertex(mode.destinyID))
416 | vertices[mode.startID].deleteEdgeWithThatVertex(mode.destinyID);
417 |
418 | else if(mode.startID!=mode.destinyID)
419 | vertices[mode.startID].addEdgeToVertex(mode.destinyID);
420 |
421 | mode.type="edgeFirst";
422 | }
423 | }
424 |
425 | else if(mode.type=="edgeFirst" && mode.displayValues)
426 | {
427 | let IDs=Object.keys(vertices);
428 |
429 | for(let indexID=0; indexIDscreenHeight/8+vertexRatio &&
472 | p.mouseY+vertexRatiovertexRatio && p.mouseX+vertexRatio
581 | {
582 | setTimeout(resolve, ms);
583 | });
584 | }
585 |
586 | async function dfs(ID, prevID)
587 | {
588 | await vertices[ID].changeVertexColor("green");
589 |
590 | const neighboursIDs=vertices[ID].connectedIDsAndCosts;
591 |
592 | for(let newID in neighboursIDs)
593 | {
594 | if(vertices[newID].color=="grey")
595 | {
596 | vertices[ID].changeEdgeColor(newID, "green");
597 | await dfs(newID, ID);
598 | }
599 | }
600 |
601 | await vertices[ID].changeVertexColor("red");
602 | vertices[prevID].changeEdgeColor(ID, "red");
603 | }
604 |
605 | function showQueueToUser(queueInfo)
606 | {
607 | p.fill("green");
608 | p.stroke("green");
609 | p.rect(0, 0, screenWidth, screenHeight/8);
610 |
611 | p.textAlign(p.CENTER);
612 | p.textSize((p.width+p.height)/60);
613 | const[x, y]=[screenWidth/2, screenHeight/20];
614 | p.strokeWeight(3);
615 | p.fill("white")
616 | p.stroke("black");
617 | p.text("Queue:", x, y);
618 | let text="";
619 |
620 | if(queueInfo.length==0)
621 | return;
622 |
623 | for(let x=0; xcheckingVertices[ID].distance)
671 | [minimumDistance, resultID]=[checkingVertices[ID].distance, ID];
672 | }
673 |
674 | return resultID;
675 | }
676 |
677 | async function dijkstra(startID, destinyID)
678 | {
679 | const checkingVertices={...vertices};
680 |
681 | for(let ID in vertices)
682 | {
683 | vertices[ID].distance=Number.MAX_VALUE;
684 | vertices[ID].previousID=-1;
685 | }
686 | vertices[startID].distance=0;
687 |
688 | while(Object.keys(checkingVertices).length!=0)
689 | {
690 | const minVertexID=minimumForDijkstra(checkingVertices);
691 | const minVertex=checkingVertices[minVertexID];
692 | delete checkingVertices[minVertexID];
693 |
694 | for(let neighbourID in minVertex.connectedIDsAndCosts)
695 | {
696 | const neighbourVertex=vertices[neighbourID];
697 | const distance=minVertex.distance+minVertex.connectedIDsAndCosts[neighbourID];
698 |
699 | if(distance0; x--)
722 | {
723 | const vertex=vertices[path[x]];
724 | await vertex.changeVertexColor("green");
725 | vertex.changeEdgeColor(path[x-1], "green");
726 | vertex.displayVertex();
727 | }
728 | await vertices[path[0]].changeVertexColor("green");
729 | }
730 |
731 | else
732 | {
733 | mode.type="noPath";
734 | notifyToUser();
735 | }
736 | }
737 |
738 | function findParent(parents, ID)
739 | {
740 | if(parents[ID]==ID)
741 | return ID;
742 | return findParent(parents, parents[ID]);
743 | }
744 |
745 | async function kruskal()
746 | {
747 | const outputPath=[];
748 | const parents={}; //{..., ID1: ID2}
749 | const edges=[]; //[...,[cost, ID1, ID2]]
750 | for (let ID in vertices)
751 | {
752 | parents[ID]=ID;
753 | for(let neighbourID in vertices[ID].connectedIDsAndCosts)
754 | {
755 | if(parseInt(neighbourID){return (arr1[0]-arr2[0])});
761 |
762 | mode.pathCost=0;
763 | const numberOfVertices=Object.keys(vertices).length;
764 |
765 | for(let index=0; outputPath.length!=(numberOfVertices-1) && index
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
53 | {
54 | (algorithm.hasOwnProperty("imageExplication"+counter.toString()))?
55 |