有没有谁收集高引用文章不时读一读？# Biology - 生物学
g*e
1 楼
given a directed graph.
each edge has weight {0,1,2,...K}
from a start node s, find shortest path to all nodes in the network. Give
an O(K|V|+|E|) algorithm.
V is number of nodes, E number of edges
each edge has weight {0,1,2,...K}
from a start node s, find shortest path to all nodes in the network. Give
an O(K|V|+|E|) algorithm.
V is number of nodes, E number of edges
