n为图的顶点个数,e为图中弧的数目,则图的拓扑排序算法的时间复杂度为()
A.
O(n)
B.
O(e)
C.
O(n-e)
D.
O(n+e)
正确答案是D
If for any reason you are ( ) with this software, return it within thirty days for a full refund. (satisfied)