Directed Graph Topological Sorting

Project Description:

given an input of a matrix of a directed graph, do a topological sort to determine if a cycle exists. Using arrays or linked list ONLY.

input file

  • line 1: n vertices
  • next lines: row by row matrix
  • rows have binary length n
  • the next n lines must contain the matrix r x r, each row containing a binary string of length n

if no cycle: display vertices which belong to vertices

if no cycle: display "no cycle exists" & show topological sort

Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.