backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 02:59:43 +08:00
Code Issues Projects Releases Wiki Activity

Fix linter warnings in fixgraph branch.

Browse Source
This commit is contained in:
Filip Hlásek
2020-08-01 22:55:50 -07:00
parent c107f99db9
commit e2f344c498
8 changed files with 92 additions and 131 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
graph/cycle_check_directed_graph.cpp
View File

@@ -1,39 +1,44 @@
#include <iostream>
#include <vector>
#include <stdlib.h>
#include <cstdlib>
using std::vector;
using std::pair;
void explore(int i, vector<vector<int>> &adj, int *state)
void explore(int i, const vector<vector<int>> &adj, std::vector<int> *state)
{
state[i] = 1;
for(auto it2 : adj[i])
(*state)[i] = 1;
for (const auto it2 : adj[i])
{
if (state[it2] == 0)
if ((*state)[it2] == 0)
{
explore(it2, adj,state);
explore(it2, adj, state);
}
if (state[it2] == 1)
if ((*state)[it2] == 1)
{
std::cout<<"1";
exit(0);
}
}
state[i] = 2;
(*state)[i] = 2;
};
int acyclic(vector<vector<int> > &adj,size_t n) {
int acyclic(const vector<vector<int> > &adj, size_t n) {
//write your code here
int state[n]; // permitted states are 0 1 and 2
// permitted states are 0 1 and 2
std::vector<int> state(n, 0);
// mark the states of all vertices initially to 0
for(int i=0;i<n;i++)
for (size_t i = 0; i < n; i++)
{
state[i] = 0;
}
for(auto it1 = 0; it1 != adj.size(); it1++)
for (size_t it1 = 0; it1 != adj.size(); it1++)
{
if (state[it1] == 0)
explore(it1,adj,state);
{
explore(it1, adj, &state);
}
if (state[it1] == 1)
{
std::cout<<"1";
@@ -45,11 +50,11 @@ int acyclic(vector<vector<int> > &adj,size_t n) {
}
int main() {
size_t n, m;
size_t n = 0, m = 0;
std::cin >> n >> m;
vector<vector<int> > adj(n, vector<int>());
for (size_t i = 0; i < m; i++) {
int x, y;
int x = 0, y = 0;
std::cin >> x >> y;
adj[x - 1].push_back(y - 1);
}