def topological_sort():
	pass


def main():
	pass

if __name__ == '__main__':
	main()

def topological_sort_recur():
	"""Topological Sorting by Recursion."""
	pass

def topological_sort():
	"""Topological Sorting for Directed Acyclic Graph (DAG)."""
	pass


def main():
	# DAG.
	adjacency_dict = {
	    '0': {},
	    '1': {},
	    '2': {'3'},
	    '3': {'1'},
	    '4': {'0', '1'},
	    '5': {'0', '2'}
	}

if __name__ == '__main__':
	main()

Add topolofical_sort_recur(), 2 functions’s doc strings and DAG
Add topolofical_sort_recur(), 2 functions’s doc strings and DAG

+ def topological_sort_recur():
+ 	"""Topological Sorting by Recursion."""
+ 	pass
+ 
  def topological_sort():
+ 	"""Topological Sorting for Directed Acyclic Graph (DAG)."""
  	pass
  
  
  def main():
- 	pass
+ 	# DAG.
+ 	adjacency_dict = {
+ 	    '0': {},
+ 	    '1': {},
+ 	    '2': {'3'},
+ 	    '3': {'1'},
+ 	    '4': {'0', '1'},
+ 	    '5': {'0', '2'}
+ 	}
  
  if __name__ == '__main__':
  	main()
  
Add topolofical_sort_recur(), 2 functions’s doc strings and DAG
## Code Before:
def topological_sort():
	pass


def main():
	pass

if __name__ == '__main__':
	main()

## Instruction:
Add topolofical_sort_recur(), 2 functions’s doc strings and DAG
## Code After:
def topological_sort_recur():
	"""Topological Sorting by Recursion."""
	pass

def topological_sort():
	"""Topological Sorting for Directed Acyclic Graph (DAG)."""
	pass


def main():
	# DAG.
	adjacency_dict = {
	    '0': {},
	    '1': {},
	    '2': {'3'},
	    '3': {'1'},
	    '4': {'0', '1'},
	    '5': {'0', '2'}
	}

if __name__ == '__main__':
	main()
