Skip to content

Commit 5fd64fa

Browse files
author
EdwinIZ8
committed
fix: main function bugs
1 parent 2dadbf7 commit 5fd64fa

File tree

1 file changed

+9
-9
lines changed

1 file changed

+9
-9
lines changed

greedy_algorithms/kruskals_minimum_spanning_tree.cpp

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -55,15 +55,15 @@ void findMinimumEdge(const int &infinity,
5555
* @returns 0 on exit
5656
*/
5757
int main() {
58-
constexpr int INFINITY = 99999;
59-
std::array<std::array<int, 6>, 6> graph{
60-
0, 4, 1, 4, INFINITY, INFINITY,
61-
4, 0, 3, 8, 3, INFINITY,
62-
1, 3, 0, INFINITY, 1, INFINITY,
63-
4, 8, INFINITY, 0, 5, 7,
64-
INFINITY, 3, 1, 5, 0, INFINITY,
65-
INFINITY, INFINITY, INFINITY, 7, INFINITY, 0};
58+
constexpr int POSITIVE_INFINITY = 99999;
59+
std::array<std::array<int, 6>, 6> graph = {
60+
0, 4, 1, 4, POSITIVE_INFINITY, POSITIVE_INFINITY,
61+
4, 0, 3, 8, 3, POSITIVE_INFINITY,
62+
1, 3, 0, POSITIVE_INFINITY, 1, POSITIVE_INFINITY,
63+
4, 8, POSITIVE_INFINITY, 0, 5, 7,
64+
POSITIVE_INFINITY, 3, 1, 5, 0, POSITIVE_INFINITY,
65+
POSITIVE_INFINITY, POSITIVE_INFINITY, POSITIVE_INFINITY, 7, POSITIVE_INFINITY, 0};
6666

67-
greedy_algorithms::findMinimumEdge(INFINITY, graph);
67+
greedy_algorithms::findMinimumEdge(POSITIVE_INFINITY, graph);
6868
return 0;
6969
}

0 commit comments

Comments
 (0)