最近友人问我一个算法的考题
找了很多资料还是不太会想请教大大们
Let G be a direct acyclic graph with vertex set V and arc set E. Suppose that
s is the only vertwx with in-degree zero. Consider following for finding the
shorest path lengths from s to all the other vertices. Here each arc has unit
length.
Algorithm TTT
find a (__) (v1=s,v2,...,vn) of G // What kind of sequence it is
set d[1]=0 and d[i]=n for any i>1;
for i from 1 to n-1 do
for each j such that there is an arc (vi,vj) do
if (__) then (__)
the time complexity is O(__)
问这4个填空
我只有找到是最后一个好像是O(|V|+|E|)
不知道可不可以在这问，如果不行我会删除
感谢!