|
f*****e
发帖数: 2992 | 2 如果告诉你G是cactus graph，并且有m条边，n个点，cycles数目就直接可以算出来了m
-n+1。如果没有告诉你m和n，你遍历G，求出m和n，然后再算m-n+1就行了。 |
|
|
|
f*********m
发帖数: 726 | 5 估计是对preprocessing以后的graph进行bfs |
|
h****g
发帖数: 105 | 6 刚做了下 Graph Clone, Output Limit Exceeded. 查了半天也没看出来哪里有问题，
附上代码，请大牛门挑挑毛病，谢拉！
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
// Note: The Solution object is instantiated only once and is reused
by each test case.
if (!node) return NULL;
UndirectedGraphNode * nodecopy;
queue que;
unordered_map map;
nodecopy=new UndirectedGraphNode(node->label);
que.push(n... 阅读全帖 |
|
s********u
发帖数: 1109 | 7 话说，这个题用bfs比dfs有什么优势么？感觉不是最短路径之类问题的话，差不多吧？
dfs思路清晰，代码精简。其实就是D&C，假定subgraph已经建立好，那么如何求解
graph
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node,unordered_map<
UndirectedGraphNode *,UndirectedGraphNode *>& nodeMap ){
if(!node) return NULL;
if(nodeMap.count(node) > 0)
return nodeMap[node];
UndirectedGraphNode *newNode = new UndirectedGraphNode(node->label);
nodeMap[node] = newNode;
vector阅读全帖 |
|
b**m
发帖数: 1466 | 8 Directed graph without cycle.
For each node n, there may be two paths(p1,p2) started from this node. Every
node on these two paths should only be in one path(except the start node).
Let L(n) = min(len(p1),len(p2))
how to figure out max(L) |
|
g*********e
发帖数: 14401 | 9 graph database什么的，好象是infra下面的。有人知道具体都干啥吗？谢谢 |
|
A*****i
发帖数: 3587 | 10 据说L家的老印都是干货？
graph应该是挺核心的部分吧，用户之间关系的那部分难道不是这个组搞的么？
瞎猜的，等大牛来答 |
|
d****n
发帖数: 233 | 11 把
for(auto neighbor: node->neighbors){
graphCopy->neighbors.push_back(DFS(node,mp));
}
改成
for(auto neighbor: node->neighbors){
graphCopy->neighbors.push_back(DFS(neighbor,mp));
}
另外，可以参考我的blog for the two ways to solve this problem:
http://codeanytime.blogspot.com/2014/11/clone-graph.html |
|
e********3
发帖数: 229 | 12 1. 给定2 threads, 每个thread相隔一个小时运行一次.他们运行时会调用myclass 里
的doWork method. 这个method就是update myclass里的一个field.比如一个int filed
.这个dowork method保证在2分钟之内完成. thread会在一开始运行时就call这个
method. 请问对这个method我们需要synchronization吗?
2. 如何implement 领英的social graph. 要求给定2个user,你能快速查出这2个user是
不是直接connected或者间接connected.比如2nd connection, 3rd connection.
3. 接2, 如果要求能查出某个user有多少个direct connections呢?
求大牛解惑 |
|
c***p
发帖数: 17 | 13 Social graph 这题是不是一般用bidirectional BFS? 然后直接看两个用户间的距离？
filed |
|
g******y
发帖数: 143 | 14 做题遇到以下一个表示法， 请问以下表示的是什么样的graph?
{0,1,2,3,4#1,3,4#2,1,4#3,4#4} |
|
|
|
g*********e
发帖数: 14401 | 17 Graph组现在做这个的牛人足够了，不由你操心。 |
|
l********p
发帖数: 1234 | 18 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
d****e
发帖数: 99 | 19 and w510's 5100m graph card is better than gt 240m |
|
l********p
发帖数: 1234 | 20 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
a*****e
发帖数: 1717 | 21 I thought about it,
tick/second level data might not help for retailer.
even for scalper, < 1 pt target might not be optimum.
This graph shows there are certain critical time to pay attention.
Avoid trading for some style of trading, but best chances for other styles.
about |
|
a*****e
发帖数: 1717 | 22 it is common sense, but more informative than that, You missed several
points.I won't bother if it's not profitable graph:)
Every liquidity peak, there is a small window for a very strong trend(no
matter it’s cross market driven or daily maintenance or scheduled economic
data driven). There is normally some tendency for a reversal at some
critical point which provides best chance for scalping.
For example, 3pm — close time for bond market. 10am — potential open range
breakout, I called that is s... 阅读全帖 |
|
g*****u
发帖数: 14294 | 23 Where are the trend reversals in the graph?
economic
range |
|
|
c*******y
发帖数: 1630 | 25 记得以前有人提什么HQ定律什么，这个是最基本的weekly pattern graph而已。
SPX的并没有什么edge。这个统计可能有点久，我有新的统计，不知道怎么发上来。
reading:
Always start from X on Monday,
if (Monday_close-LastFriday_close)*(Weekday_close-Monday_close)>0, then X
else then O
numbers are in %, nothing higher than 70% for SPX,
it is said Heating Oil has > 70% pattern. |
|
d*j
发帖数: 756 | 26 之前一直用 git， gitk 用着真爽。 最近转到svn 下，不知道 linux 下 svn 有啥好
的工具可以显示 revision graph 么？ 最好是免费的，看了 smartsvn, 但是好像这
个功能只能试用。
谢谢～～ |
|
d******e
发帖数: 2541 | 27 谁有超轻型PRINCE TT GRAPHE出售？
俺特别情有独钟这个型号，用它征战USTA两季战果显著。上了线才8。9盎司。俺用
来特爽。可惜这个型号很早就绝种了。一直看不。现在只好用HEAD SI 5代替。
有人出售或转让请告知8成新都可以考虑。
dok
e me if you have for sale: d******[email protected] |
|
m*****i
发帖数: 1873 | 28 is the graph not clear? |
|
c********e
发帖数: 267 | 29 graph is clear.
It seems that your allin EV is always around 0 (-200
understanding it wrong? |
|
w*******g
发帖数: 9932 | 30 how about just depth first search from type2 nodes.
it seems type1, type2 nodes are the two sets of nodes in a bipartite graph.
I don't see any advantage of knowing this somehow. |
|
w*******g
发帖数: 9932 | 31
Maybe you could search for problems related to graph coloring. I am not sure. |
|
m*****r
发帖数: 9 | 32 It looks like a probability problem, not much graph theory needed.
if
threshold, |
|
r****c
发帖数: 2585 | 33 Every node $v_i$ has two label $(a_i,b_i)$, the distance from $v_i$ to $v_j$
is $|a_i-b_j|$. The graph is directional. |
|
p*******s
发帖数: 7 | 34 比如说给定10个nodes,要求建立一个linear graph,即不能有环，一个nodes的边不大于2
条。有没有什么算法能随机给出一个符合要求的adjacency matrix? |
|
w****d
发帖数: 743 | 35 Please recommend a couple of good graph thoery books for CS.
Thanks. |
|
f******k
发帖数: 297 | 36 Standard recommendation is Bollobas's book. Diestel's book (available online
) is also very good, especially on graph minors (since I guess very few
would take the time to read Robertson and Seymour's series of papers). |
|
c*********n
发帖数: 128 | 37 Thank you for your reply.
I am talking about undirected graph, for sure. |
|
s*******y
发帖数: 558 | 38 难道你不知道determine a good/optimal graph layout 是NP-hard problem么? |
|
s*******y
发帖数: 558 | 39 不觉得matlab能处理这么大的数据量 我最近用matlab处理8000多个node的graph，
sparse matrix 表示，计算average path length, 1GB memory, 彻底不行。
建议你用c/c++/perl, 同时用edge list表示图 |
|
j**********s
发帖数: 132 | 40 如果 bipartite graph 也可以的化，不妨试试这个 Netflix prize dataset
http://www.netflixprize.com
如果你的程序能比 netflix 的 benchmark 强 10% 的化，可以拿到 1M USD 的
奖金。目前的记录是比 benchmark 强 8.46% |
|
s******e
发帖数: 285 | 41 没看懂你说什么，不如用中文表述吧。。。
graph
the |
|
m*****f
发帖数: 1243 | 42 if I removed some paths from this graph
(does not mean removing edges)
???? |
|
z1
发帖数: 389 | 43 path is consisit of edges ...
graph
the |
|
v********e
发帖数: 1058 | 44 i still don't understand. what is "reconstuct graph"?
rem |
|
C********p
发帖数: 92 | 45 试着用Facebook Graph API Explorer在没有用户permission的情况下查询信息。但一
些在Facebook官网能得到的信息，比如likes，friends等都查不到。这是为什么呢？
Facebook SDK估计也一样吧？谢谢。 |
|
g*****a
发帖数: 29 | 46 用ACCESS存数据,产生TABLES & GRAPHS方便吗? 要用VB? |
|
f******n
发帖数: 279 | 47 拿到一个graph database的小公司的offer，在想要不要跳。 |
|
p***c
发帖数: 5202 | 48 有吧，有很多东西传统关系数据库用起来很缩手缩脚，我们目前有个项目就要用graph
db。。。我还准备学习一下，概念上还是突然接受不了，哈哈。就和当年star schema
一样，问自己很多遍为什么要酱紫啊 |
|
f******n
发帖数: 279 | 49 没有。我之前做的东西和graph相关，但我一点都不懂db，我不急着毕业，但offer截止
日期快到了。所以想了解下DB这个行业。 |
|
c**t
发帖数: 2744 | 50 not viso; any simulation graph to demostrate the congestion of a network? |
|
