greedy_algorithms Namespace Reference

for std::vector More...

Namespaces
namespace	dijkstra
	Functions for the Dijkstra algorithm implementation.

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.

Detailed Description

for std::vector

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()

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

nums	array 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

                                          {
    size_t lastPos = nums.size() - 1;
    for (size_t i = lastPos; i != static_cast<size_t>(-1); i--) {
        if (i + nums[i] >= lastPos) {
            lastPos = i;
        }
    }
    return lastPos == 0;
}

Here is the call graph for this function:

findMinimumEdge()

template<typename T >

void greedy_algorithms::findMinimumEdge	(	const int &	infinity,
		const std::array< std::array< T, 6 >, 6 > &	graph )

Finds the minimum edge of the given graph.

Parameters

infinity	Defines the infinity of the graph
graph	The graph that will be used to find the edge

Returns

void

                                                               {
    for (int i = 0; i < graph.size(); i++) {
        int min = infinity;
        int minIndex = 0;
        for (int j = 0; j < graph.size(); j++) {
            if (graph[i][j] != 0 && graph[i][j] < min) {
                min = graph[i][j];
                minIndex = j;
            }
        }
        std::cout << i << "  -  " << minIndex << "\t" << graph[i][minIndex]
                  << "\n";
    }
}