DCSC.cpp

#include <bits/stdc++.h>
using namespace std;



void DFS(long long v,map<long long, vector<long long>> &adj,vector<long long> &ans){
	ans.push_back(v);
	auto itr = adj.find(v);
	if(itr != adj.end()){
		vector<long long> aux = itr->second;
		for(int i=0;i<aux.size();i++){
			ans.push_back(aux[i]);
			DFS(aux[i],adj,ans);
		}
	}
	else
		return;
}

vector<long long> desc(map<long long, vector<long long>> &adj,long long v){
	vector<long long> ans;
	DFS(v,adj,ans);
	return ans;
}

vector<long long> pred(map<long long, vector<long long>> &adj,long long v){
	vector<long long> nodes,ans;
	for(map<long long, vector<long long>>:iterator it = adj.begin(); itr != adj.end(); itr++){
		nodes.push_back(itr->first);
	}
	
	for(int i=0;i<nodes.size();i++){
		vector<long long> aux = desc(nodes[i]);
		auto itr = find(aux.begin(),aux.end(),v);
		if(itr != aux.end()){
			ans.push_back(nodes[i]);
		}
	}
	return ans;
}



vector<long long> DCSC(long long E,long long V, map<long long,vector<long long>> &adj, char *filename ){
	map<long long, vector<long long>> desc,pred,rem;
	
	if(E == 0){
		ofstream myfile;
		myfile.open(filename);
		
		for(std::map<long long,vector<long long>>::iterator iter = adj.begin(); iter != adj.end(); ++iter){
			long long k =  iter->first;
			myfile << k << "\n";
		}
		
		myfile.close();
		return;
	}
	
	else{
		
	}
}

int main(int argc, char**argv){
	char *filename = argv[1];
	long long V,E;
	
	cin >> V >> E;
	
	
}