[LeetCode]Course Schedule

1. This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
2. Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
3. Topological sort could also be done via BFS.

#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

struct Node
{
	int num;
	vector<Node*> next;
	int indegree;
	bool ischeck;
	
	Node(int n)
	{
		num=n;
		ischeck=false;
		indegree=0;
	}
};

bool TopologicalSort(int numCourses,vector<Node*>& graph)
{
	queue<Node*> list;
	vector<Node*> sortedList;
	int count;
	for(int i=0;i<numCourses;i++)
	{
		if(graph[i]->indegree==0&&graph[i]->ischeck==false)
		{
			list.push(graph[i]);
		}
	}
	
	while(list.size()>0)
	{
		Node* temp=list.front();
		//cout<<"temp is "<<temp->num;
		sortedList.push_back(list.front());
		temp->ischeck=true;
		//cout<<"     "<<temp->num<<"'s ischeck is "<<temp->ischeck<<endl;
		list.pop();
		
		for(int i=0;i<temp->next.size();i++)
		{
			temp->next[i]->indegree--;
			if(temp->next[i]->indegree==0)
			{
			    list.push(temp->next[i]);
			    //cout<<"list pushback "<<temp->next[i]->num<<endl;
			}
		}
	}
	
	if(sortedList.size()==numCourses)
	{
		return true;
	}
	else
	{
		return false;
	}
}

bool canFinish(int numCourses, vector<pair<int, int> >& prerequisites)
{
    if(prerequisites.size()==0)
    {
        return true;
    }
    
	bool finish=true;
	//queue<Node*> tocheck;
	vector<Node*> graph;
	for(int i=0;i<numCourses;i++)
	{
		Node* temp=new Node(i);
		graph.push_back(temp);
	}
	
	int size=prerequisites.size();
	for(int i=0;i<size;i++)
	{
		int first=prerequisites[i].first;
		int second=prerequisites[i].second;
		graph[second]->next.push_back(graph[first]);
		graph[first]->indegree++;
	}
	
	finish=TopologicalSort(numCourses,graph);
	
	return finish;
}