OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: remove using namespace std (#1264)

Browse Source 
Remove `using namespace std;` in greedy_algorithms/kruskals_minimum_spanning_tree.cpp

* remove using namespace std

* change static C array to vector

* change vector to array and remove global variable
This commit is contained in:
x0rld 2020-10-19 23:40:03 +02:00 committed by GitHub
parent 7f97119f8a
commit 234a29939a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 15 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
greedy_algorithms/kruskals_minimum_spanning_tree.cpp
View File

@ -1,31 +1,30 @@
#include <iostream> #include <iostream>
using namespace std; #include <array>
#define V 6 void findMinimumEdge(int INFINITY, std::array< std::array< int ,6 >,6 > graph) {
#define INFINITY 99999 for (int i = 0; i < graph.size(); i++) {
int graph[V][V] = {{0, 4, 1, 4, INFINITY, INFINITY},
{4, 0, 3, 8, 3, INFINITY},
{1, 3, 0, INFINITY, 1, INFINITY},
{4, 8, INFINITY, 0, 5, 7},
{INFINITY, 3, 1, 5, 0, INFINITY},
{INFINITY, INFINITY, INFINITY, 7, INFINITY, 0}};
void findMinimumEdge() {
for (int i = 0; i < V; i++) {
int min = INFINITY; int min = INFINITY;
int minIndex = 0; int minIndex = 0;
for (int j = 0; j < V; j++) { for (int j = 0; j < graph.size(); j++) {
if (graph[i][j] != 0 && graph[i][j] < min) { if (graph[i][j] != 0 && graph[i][j] < min) {
min = graph[i][j]; min = graph[i][j];
minIndex = j; minIndex = j;
} }
} }
cout << i << " - " << minIndex << "\t" << graph[i][minIndex] << "\n"; std::cout << i << " - " << minIndex << "\t" << graph[i][minIndex] << std::endl;
} }
} }
int main() { int main() {
findMinimumEdge(); constexpr int INFINITY = 99999;
std::array< std::array< int ,6 >,6 >graph
{0, 4, 1, 4, INFINITY, INFINITY,
4, 0, 3, 8, 3, INFINITY,
1, 3, 0, INFINITY, 1, INFINITY,
4, 8, INFINITY, 0, 5, 7,
INFINITY, 3, 1, 5, 0, INFINITY,
INFINITY, INFINITY, INFINITY, 7, INFINITY, 0};
findMinimumEdge(INFINITY,graph);
return 0; return 0;
} }