算法作业2 - JobHunting版

本页内容为未名空间相应帖子的节选和存档，一周内的贴子最多显示50字，超过一周显示500字访问原贴

相关主题
● in what case O(n*2) is better than O(n).	● 一道linkedin的graph题
● 请教一道面试题	● 问一道题（groupon）
● 问个g的面试题	● a question on finding longest path between two vertices
● 请教一下超大图的存储问题	● 请教一个算法
● Graph problem	● Find shortest among two nodes in binary tree
● 关于leetcode上的jump code1和2问题的一点讨论	● PageRank简单问题
● Depth-First-Search	● A problem.
● 报Google Offer并请教面试题	● [合集] Google Phone Interview

相关话题的讨论汇总
话题: nodes话题: number话题: give

进入JobHunting版参与讨论

(共1页)

g*********e
发帖数: 14401

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

(共1页)

进入JobHunting版参与讨论

相关主题
● [合集] Google Phone Interview	● Graph problem
● 图的拷贝	● 关于leetcode上的jump code1和2问题的一点讨论
● Amazon面试题请教	● Depth-First-Search
● 一道fb的题，clone a graph	● 报Google Offer并请教面试题
● in what case O(n*2) is better than O(n).	● 一道linkedin的graph题
● 请教一道面试题	● 问一道题（groupon）
● 问个g的面试题	● a question on finding longest path between two vertices
● 请教一下超大图的存储问题	● 请教一个算法

相关话题的讨论汇总
话题: nodes话题: number话题: give

#	版面	帖数(主题数)
-	全站	4871 (796)
1	Military	3777 (569)
2	Stock	341 (51)
3	Joke	117 (17)
4	History	116 (3)
5	Automobile	100 (9)
6	USANews	55 (9)
7	Midlife	45 (1)
8	Headline	41 (41)
9	Dreamer	33 (13)
10	FleaMarket	32 (20)
11	Living	30 (7)

boards

未名新帖统计// 7月16日

历史上的今天