diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html index 08f14bb26..c8cd8629b 100644 --- a/d2/d90/namespacegreedy__algorithms.html +++ b/d2/d90/namespacegreedy__algorithms.html @@ -122,6 +122,9 @@ Namespaces + + + @@ -132,9 +135,54 @@ Functions

for IO operations

for assert for INT_MAX for IO operations

Greedy Algorithms

+

for assert for std::cout

+

Greedy Algorithms

for array

Greedy Algorithms

Function Documentation

+ +

◆ can_jump()

+ +
+
+

Functions

bool can_jump (const std::vector< int > &nums)
 Checks whether the given element (default is 1) can jump to the last index.
 
template<typename T >
void findMinimumEdge (const int &infinity, const std::array< std::array< T, 6 >, 6 > &graph)
 Finds the minimum edge of the given graph.
+ + + + + + +
bool greedy_algorithms::can_jump (const std::vector< int > & nums)
+
+ +

Checks whether the given element (default is 1) can jump to the last index.

+
Parameters
+ + +
numsarray of numbers containing the maximum jump (in steps) from that index
+
+
+
Returns
true if the index can be reached
+
+false if the index can NOT be reached
+
42 {
+
43 size_t lastPos = nums.size() - 1;
+
44 for (size_t i = lastPos; i != static_cast<size_t>(-1); i--) {
+
45 if (i + nums[i] >= lastPos) {
+
46 lastPos = i;
+
47 }
+
48 }
+
49 return lastPos == 0;
+
50}
+
std::vector::size
T size(T... args)
+
+Here is the call graph for this function:
+
+
+
+ +
+

◆ findMinimumEdge()

diff --git a/d2/d90/namespacegreedy__algorithms.js b/d2/d90/namespacegreedy__algorithms.js index 1140d65e4..8127b22da 100644 --- a/d2/d90/namespacegreedy__algorithms.js +++ b/d2/d90/namespacegreedy__algorithms.js @@ -1,5 +1,6 @@ var namespacegreedy__algorithms = [ [ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra" ], + [ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ], [ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a127ce4403660032f53ae2e6467e5427d", null ] ]; \ No newline at end of file diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map new file mode 100644 index 000000000..70affb272 --- /dev/null +++ b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5 b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5 new file mode 100644 index 000000000..a8a778259 --- /dev/null +++ b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5 @@ -0,0 +1 @@ +c42fb8e2aa1ecbda76282b1d15466f0d \ No newline at end of file diff --git a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.svg b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg similarity index 59% rename from df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.svg rename to d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg index 23acb6296..6d18d13ed 100644 --- a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.svg +++ b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg @@ -3,9 +3,9 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + @@ -17,14 +17,15 @@ ]]> - -canJump + +greedy_algorithms::can_jump Node1 - - -canJump + + +greedy_algorithms:: +can_jump @@ -32,8 +33,8 @@ Node2 - -std::vector::size + +std::vector::size @@ -41,8 +42,8 @@ Node1->Node2 - - + + diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg new file mode 100644 index 000000000..28c74d21b --- /dev/null +++ b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg @@ -0,0 +1,40 @@ + + + + + + +greedy_algorithms::can_jump + + +Node1 + + +greedy_algorithms:: +can_jump + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + + + + diff --git a/d5/d79/jump__game_8cpp__incl.map b/d5/d79/jump__game_8cpp__incl.map new file mode 100644 index 000000000..49af1b437 --- /dev/null +++ b/d5/d79/jump__game_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d5/d79/jump__game_8cpp__incl.md5 b/d5/d79/jump__game_8cpp__incl.md5 new file mode 100644 index 000000000..22b743fe7 --- /dev/null +++ b/d5/d79/jump__game_8cpp__incl.md5 @@ -0,0 +1 @@ +becd4ae2f466d04a1ba167e3d07a4053 \ No newline at end of file diff --git a/d8/df6/jumpgame_8cpp__incl.svg b/d5/d79/jump__game_8cpp__incl.svg similarity index 55% rename from d8/df6/jumpgame_8cpp__incl.svg rename to d5/d79/jump__game_8cpp__incl.svg index 0b7dd2096..a5cede949 100644 --- a/d8/df6/jumpgame_8cpp__incl.svg +++ b/d5/d79/jump__game_8cpp__incl.svg @@ -3,9 +3,9 @@ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd"> - - + + @@ -17,14 +17,15 @@ ]]> - -greedy_algorithms/jumpgame.cpp + +greedy_algorithms/jump_game.cpp Node1 - - -greedy_algorithms/jumpgame.cpp + + +greedy_algorithms/jump +_game.cpp @@ -32,8 +33,8 @@ Node2 - -vector + +cassert @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -50,8 +51,8 @@ Node3 - -iostream + +iostream @@ -59,8 +60,8 @@ Node1->Node3 - - + + @@ -68,8 +69,8 @@ Node4 - -cassert + +vector @@ -77,8 +78,8 @@ Node1->Node4 - - + + diff --git a/d5/d79/jump__game_8cpp__incl_org.svg b/d5/d79/jump__game_8cpp__incl_org.svg new file mode 100644 index 000000000..3300c7743 --- /dev/null +++ b/d5/d79/jump__game_8cpp__incl_org.svg @@ -0,0 +1,76 @@ + + + + + + +greedy_algorithms/jump_game.cpp + + +Node1 + + +greedy_algorithms/jump +_game.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + + + + diff --git a/d6/dba/jump__game_8cpp.html b/d6/dba/jump__game_8cpp.html new file mode 100644 index 000000000..9d99bac63 --- /dev/null +++ b/d6/dba/jump__game_8cpp.html @@ -0,0 +1,235 @@ + + + + + + + +Algorithms_in_C++: greedy_algorithms/jump_game.cpp File Reference + + + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ 1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+
+Namespaces | +Functions
+
jump_game.cpp File Reference
+
+
+ +

Jumping Game algorithm implementation +More...

+
#include <cassert>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for jump_game.cpp:
+
+
+
+
+ + + + +

+Namespaces

namespace  greedy_algorithms
 for std::vector
 
+ + + + + + + + + + +

+Functions

bool greedy_algorithms::can_jump (const std::vector< int > &nums)
 Checks whether the given element (default is 1) can jump to the last index.
 
static void test ()
 Function to test the above algorithm.
 
int main ()
 Main function.
 
+

Detailed Description

+

Jumping Game algorithm implementation

+

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.

+
Author
Rakshaa Viswanathan
+
+David Leal
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + +
int main (void )
+
+ +

Main function.

+
Returns
0 on exit
+
71 {
+
72 test(); // run self-test implementations
+
73 return 0;
+
74}
+
test
static void test()
Function to test the above algorithm.
Definition jump_game.cpp:57
+
+Here is the call graph for this function:
+
+
+
+ +
+
+ +

◆ test()

+ +
+
+ + + + + +
+ + + + + + + +
static void test ()
+ 		+static
+
+ +

Function to test the above algorithm.

+
Returns
void
+
57 {
+
58 assert(greedy_algorithms::can_jump(std::vector<int>({4, 3, 1, 0, 5})));
+
59 assert(!greedy_algorithms::can_jump(std::vector<int>({3, 2, 1, 0, 4})));
+
60 assert(greedy_algorithms::can_jump(std::vector<int>({5, 9, 4, 7, 15, 3})));
+
61 assert(!greedy_algorithms::can_jump(std::vector<int>({1, 0, 5, 8, 12})));
+
62 assert(greedy_algorithms::can_jump(std::vector<int>({2, 1, 4, 7})));
+
63
+
64 std::cout << "All tests have successfully passed!\n";
+
65}
+ +
greedy_algorithms::can_jump
bool can_jump(const std::vector< int > &nums)
Checks whether the given element (default is 1) can jump to the last index.
Definition jump_game.cpp:42
+ +
+Here is the call graph for this function:
+
+
+
+ +
+
+
+
+ + + + diff --git a/d6/dba/jump__game_8cpp.js b/d6/dba/jump__game_8cpp.js new file mode 100644 index 000000000..65ef38f36 --- /dev/null +++ b/d6/dba/jump__game_8cpp.js @@ -0,0 +1,6 @@ +var jump__game_8cpp = +[ + [ "can_jump", "d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502", null ], + [ "main", "d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test", "d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] +]; \ No newline at end of file diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map new file mode 100644 index 000000000..52f436c83 --- /dev/null +++ b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 new file mode 100644 index 000000000..8de68fe40 --- /dev/null +++ b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -0,0 +1 @@ +70ce6bd1bf4944aea6051b9d04b969c5 \ No newline at end of file diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg new file mode 100644 index 000000000..f8a889739 --- /dev/null +++ b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -0,0 +1,84 @@ + + + + + + + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +greedy_algorithms:: +can_jump + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::size + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg new file mode 100644 index 000000000..5a856cd5e --- /dev/null +++ b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -0,0 +1,58 @@ + + + + + + +test + + +Node1 + + +test + + + + + +Node2 + + +greedy_algorithms:: +can_jump + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::vector::size + + + + + +Node2->Node3 + + + + + + + + diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..5255277dd --- /dev/null +++ b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..cc9a7785f --- /dev/null +++ b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +d507de48ae0db31fa3506a26c91e1225 \ No newline at end of file diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..f7ca9383d --- /dev/null +++ b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,102 @@ + + + + + + + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +greedy_algorithms:: +can_jump + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + + + + + + + + + diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..ba088d547 --- /dev/null +++ b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,76 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +test + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +greedy_algorithms:: +can_jump + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + + + + diff --git a/d8/df6/jumpgame_8cpp__incl.map b/d8/df6/jumpgame_8cpp__incl.map deleted file mode 100644 index e5ba6761b..000000000 --- a/d8/df6/jumpgame_8cpp__incl.map +++ /dev/null @@ -1,9 +0,0 @@ - - - - - - - - - diff --git a/d8/df6/jumpgame_8cpp__incl.md5 b/d8/df6/jumpgame_8cpp__incl.md5 deleted file mode 100644 index e6c70805a..000000000 --- a/d8/df6/jumpgame_8cpp__incl.md5 +++ /dev/null @@ -1 +0,0 @@ -411bfa00b0abb9d5ae04cbfc3ffb5d69 \ No newline at end of file diff --git a/d8/df6/jumpgame_8cpp__incl_org.svg b/d8/df6/jumpgame_8cpp__incl_org.svg deleted file mode 100644 index b511265e6..000000000 --- a/d8/df6/jumpgame_8cpp__incl_org.svg +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - -greedy_algorithms/jumpgame.cpp - - -Node1 - - -greedy_algorithms/jumpgame.cpp - - - - - -Node2 - - -vector - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -iostream - - - - - -Node1->Node3 - - - - - - - - -Node4 - - -cassert - - - - - -Node1->Node4 - - - - - - - - diff --git a/df/d64/jumpgame_8cpp.html b/df/d64/jumpgame_8cpp.html deleted file mode 100644 index 90bd3da17..000000000 --- a/df/d64/jumpgame_8cpp.html +++ /dev/null @@ -1,276 +0,0 @@ - - - - - - - -Algorithms_in_C++: greedy_algorithms/jumpgame.cpp File Reference - - - - - - - - - - - - - - - - - -
-
- - - - - - -
-
Algorithms_in_C++ 1.0.0 -
-
Set of algorithms implemented in C++.
-
-
- - - - - - - - -
-
- -
-
-
- -
- -
-
- - -
-
-
-
-
-
Loading...
-
Searching...
-
No Matches
-
-
-
-
- -
-
-Functions
-
jumpgame.cpp File Reference
-
-
- -

Implementation of an algorithm to solve the jumping game problem. -More...

-
#include <vector>
-#include <iostream>
-#include <cassert>
-
-Include dependency graph for jumpgame.cpp:
-
-
-
-
- - - - - - - - - - -

-Functions

bool canJump (const std::vector< int > &nums)
 This function implements the above algorithm.
 
static void test ()
 Function to test above algorithm.
 
int main ()
 Main function.
 
-

Detailed Description

-

Implementation of an algorithm to solve the jumping game problem.

-

Problem statement: Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index. This solution takes in input as a vector and output as a boolean to check if you can reach the last position. We name the indices good and bad based on whether we can reach the destination if we start at that position. We initialize the last index as lastPos. Here, we start from the end of the array and check if we can ever reach the first index. We check if the sum of the index and the maximum jump count given is greater than or equal to the lastPos. If yes, then that is the last position you can reach starting from the back. After the end of the loop, if we reach the lastPos as 0, then the destination can be reached from the start position.

Author
Rakshaa Viswanathan
-

Function Documentation

- -

◆ canJump()

- -
-
- - - - - - - -
bool canJump (const std::vector< int > & nums)
-
- -

This function implements the above algorithm.

-
Parameters
- - -
arrayof numbers containing the maximum jump (in steps) from that index
-
-
-
Returns
bool value whether final index can be reached or not
-
26 {
-
27 auto lastPos = nums.size() - 1;
-
28 for (auto i = nums.size() - 1; i >= 0; i--) {
-
29 if (i + nums[i] >= lastPos) {
-
30 lastPos = i;
-
31 }
-
32 }
-
33 return lastPos == 0;
-
34}
-
std::vector::size
T size(T... args)
-
-Here is the call graph for this function:
-
-
-
- -
-
- -

◆ main()

- -
-
- - - - - - - -
int main (void )
-
- -

Main function.

-
Returns
0 on exit
-
65 {
-
66 test();
-
67 return 0;
-
68}
-
test
static void test()
Function to test above algorithm.
Definition jumpgame.cpp:41
-
-Here is the call graph for this function:
-
-
-
- -
-
- -

◆ test()

- -
-
- - - - - -
- - - - - - - -
static void test ()
- 		-static
-
- -

Function to test above algorithm.

-
Returns
void
-
41 {
-
42 // Test 1
-
43 std::vector<int> num1={4,3,1,0,5};
-
44 assert(canJump(num1)==true);
-
45 std::cout<<"Input: ";
-
46 for(auto i: num1){
-
47 std::cout<<i<<" ";
-
48 }
-
49 std::cout<<"Output: true"<<std::endl;
-
50 // Test 2
-
51 std::vector<int> num2={3,2,1,0,4};
-
52 assert(canJump(num2)==false);
-
53 std::cout<<"Input: ";
-
54 for(auto i: num2){
-
55 std::cout<<i<<" ";
-
56 }
-
57 std::cout<<"Output: false"<<std::endl;
-
58}
- -
std::endl
T endl(T... args)
-
canJump
bool canJump(const std::vector< int > &nums)
This function implements the above algorithm.
Definition jumpgame.cpp:26
- -
-Here is the call graph for this function:
-
-
-
- -
-
-
-
- - - - diff --git a/df/d64/jumpgame_8cpp.js b/df/d64/jumpgame_8cpp.js deleted file mode 100644 index 6f4f9d9aa..000000000 --- a/df/d64/jumpgame_8cpp.js +++ /dev/null @@ -1,6 +0,0 @@ -var jumpgame_8cpp = -[ - [ "canJump", "df/d64/jumpgame_8cpp.html#af205390325e8c999bd68b93fa5252755", null ], - [ "main", "df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], - [ "test", "df/d64/jumpgame_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ] -]; \ No newline at end of file diff --git a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map deleted file mode 100644 index 89c4e2e19..000000000 --- a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ /dev/null @@ -1,9 +0,0 @@ - - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 deleted file mode 100644 index c16f77a27..000000000 --- a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -2bb1bce3655c3ec40a1df7d0baae19e4 \ No newline at end of file diff --git a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg deleted file mode 100644 index 2d01bd49a..000000000 --- a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ /dev/null @@ -1,101 +0,0 @@ - - - - - - - - - - - - -test - - -Node1 - - -test - - - - - -Node2 - - -canJump - - - - - -Node1->Node2 - - - - - - - - -Node4 - - -std::endl - - - - - -Node1->Node4 - - - - - - - - -Node3 - - -std::vector::size - - - - - -Node2->Node3 - - - - - - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg deleted file mode 100644 index 06753f680..000000000 --- a/df/d64/jumpgame_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - -test - - -Node1 - - -test - - - - - -Node2 - - -canJump - - - - - -Node1->Node2 - - - - - - - - -Node4 - - -std::endl - - - - - -Node1->Node4 - - - - - - - - -Node3 - - -std::vector::size - - - - - -Node2->Node3 - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map deleted file mode 100644 index b2653c562..000000000 --- a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ /dev/null @@ -1,11 +0,0 @@ - - - - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 deleted file mode 100644 index ad3797543..000000000 --- a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -d8703c08ff92e9d5bfe70af68d7daa05 \ No newline at end of file diff --git a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg deleted file mode 100644 index c7996243d..000000000 --- a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - - - - - - -main - - -Node1 - - -main - - - - - -Node2 - - -test - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -canJump - - - - - -Node2->Node3 - - - - - - - - -Node5 - - -std::endl - - - - - -Node2->Node5 - - - - - - - - -Node4 - - -std::vector::size - - - - - -Node3->Node4 - - - - - - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg deleted file mode 100644 index f703595ba..000000000 --- a/df/d64/jumpgame_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ /dev/null @@ -1,93 +0,0 @@ - - - - - - -main - - -Node1 - - -main - - - - - -Node2 - - -test - - - - - -Node1->Node2 - - - - - - - - -Node3 - - -canJump - - - - - -Node2->Node3 - - - - - - - - -Node5 - - -std::endl - - - - - -Node2->Node5 - - - - - - - - -Node4 - - -std::vector::size - - - - - -Node3->Node4 - - - - - - - - diff --git a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.map b/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.map deleted file mode 100644 index 82088f953..000000000 --- a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.md5 b/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.md5 deleted file mode 100644 index f11a23ba9..000000000 --- a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -28a0d779acac6220e74738b766d12c04 \ No newline at end of file diff --git a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph_org.svg b/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph_org.svg deleted file mode 100644 index 2c8f23799..000000000 --- a/df/d64/jumpgame_8cpp_af205390325e8c999bd68b93fa5252755_cgraph_org.svg +++ /dev/null @@ -1,39 +0,0 @@ - - - - - - -canJump - - -Node1 - - -canJump - - - - - -Node2 - - -std::vector::size - - - - - -Node1->Node2 - - - - - - - - diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html index 76c6b132b..76af28ba1 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html @@ -116,8 +116,8 @@ Files  dijkstra.cpp  Dijkstra algorithm implementation
  - jumpgame.cpp - Implementation of an algorithm to solve the jumping game problem.
+ jump_game.cpp + Jumping Game algorithm implementation
   kruskals_minimum_spanning_tree.cpp  Kruskals Minimum Spanning Tree implementation
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.js b/dir_0eaa691bd54ab0922ca7f50599de6d22.js index 0a726cb89..1372d9b9f 100644 --- a/dir_0eaa691bd54ab0922ca7f50599de6d22.js +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.js @@ -2,6 +2,6 @@ var dir_0eaa691bd54ab0922ca7f50599de6d22 = [ [ "boruvkas_minimum_spanning_tree.cpp", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp" ], [ "dijkstra.cpp", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html", "df/dcb/greedy__algorithms_2dijkstra_8cpp" ], - [ "jumpgame.cpp", "df/d64/jumpgame_8cpp.html", "df/d64/jumpgame_8cpp" ], + [ "jump_game.cpp", "d6/dba/jump__game_8cpp.html", "d6/dba/jump__game_8cpp" ], [ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ] ]; \ No newline at end of file diff --git a/doxygen_crawl.html b/doxygen_crawl.html index 78c8d5e7f..76f17fe10 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -116,7 +116,7 @@ - + @@ -1355,6 +1355,7 @@ + @@ -2163,6 +2164,10 @@ + + + + @@ -3829,10 +3834,6 @@ - - - - diff --git a/files.html b/files.html index e658673c0..43d80f88c 100644 --- a/files.html +++ b/files.html @@ -217,7 +217,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze algorithm  ► greedy_algorithms  boruvkas_minimum_spanning_tree.cpp[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning Tree  dijkstra.cppDijkstra algorithm implementation - jumpgame.cppImplementation of an algorithm to solve the jumping game problem + jump_game.cppJumping Game algorithm implementation  kruskals_minimum_spanning_tree.cppKruskals Minimum Spanning Tree implementation  ► hashing  chaining.cppImplementation of hash chains diff --git a/globals_c.html b/globals_c.html index 9a9d06053..027ea9e36 100644 --- a/globals_c.html +++ b/globals_c.html @@ -107,7 +107,6 @@ $(function(){initNavTree('globals_c.html',''); initResizable(true); });
Here is a list of all documented file members with links to the documentation:

- c -