POJ 1094 Sorting It All Out（入度法求拓扑排序，成环判断）

题目来源：http://poj.org/problem?id=1094

问题描述

Sorting It All Out

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 39161		Accepted: 13808

Description

An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D implies that A < B, B < C and C < D. in this problem, we will give you a set of relations of the form A < B and ask you to determine whether a sorted order has been specified or not.

Input

Input consists of multiple problem instances. Each instance starts with a line containing two positive integers n and m. the first value indicated the number of objects to sort, where 2 <= n <= 26. The objects