Function main

Algorithms/JohnsonAlgorithm.cpp:198–228

main function

// main function
int main () {

	int t;
	cin >> t;

	int n, m;
	for (int t_no = 0; t_no < t; t_no ++) {
		cin >> n >> m;

		int u, v, w;
		for (int i = 0; i < m; i ++) {
			cin >> u >> v >> w;
			adj[u].push_back({v, w});
			edges.push_back({u, {v, w}});
		}

		int res = johnson(t_no, n, m);

		if (res == 0) {
			cout << "graph " << t_no + 1 << " ";
			cout << "no" << endl;
		}

		cout << endl;
		for (int i = 1; i <= n; i ++) {
			adj[i].clear();
			adj_new[i].clear();
		}
		edges.clear();
	}
}


/*