From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM
	autolearn=ham autolearn_force=no version=3.4.4
X-Google-Thread: 103376,cd5005cccfba0311,start
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!postnews.google.com!j27g2000cwj.googlegroups.com!not-for-mail
From: "isaac2004" <isaac_2004@yahoo.com>
Newsgroups: comp.lang.ada
Subject: Topological Sort Help
Date: 4 Feb 2007 11:54:12 -0800
Organization: http://groups.google.com
Message-ID: <1170618852.885855.258390@j27g2000cwj.googlegroups.com>
NNTP-Posting-Host: 71.231.37.231
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1170618864 20530 127.0.0.1 (4 Feb 2007 19:54:24
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sun, 4 Feb 2007 19:54:24 +0000 (UTC)
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 7.0; Windows NT 6.0; SV1;
 SLCC1; .NET CLR 2.0.50727; .NET CLR 3.0.04506),gzip(gfe),gzip(gfe)
Complaints-To: groups-abuse@google.com
Injection-Info: j27g2000cwj.googlegroups.com; posting-host=71.231.37.231;
   posting-account=bWy1LAwAAAAtVkasDCH0ykMCBMNd-FcL
Xref: g2news2.google.com comp.lang.ada:8923
Date: 2007-02-04T11:54:12-08:00
List-Id: <comp.lang.ada>

hello i am trying to further my knowledge of graphs and i keep running
into this function called topological sort. i read the definition and
somewhat understand it as a function that does the following

1. searches for a directed cycle
2. sorts vertices of a graph in order onto a stack or array of some
type so the nodes can be popped in order

so my questions are

are these reasonable thoughts on this algorithm

how would i write up an algorithm of this nature, would it be just
like traversing down a list and adding elements to a stack. thanks for
any help