C********p
发帖数: 92 | 1 试着用Facebook Graph API Explorer在没有用户permission的情况下查询信息。但一
些在Facebook官网能得到的信息，比如likes，friends等都查不到。这是为什么呢？
Facebook SDK估计也一样吧？谢谢。 |
|
s*****p
发帖数: 5342 | 2 I need draw 2D graph and display it in webpage. What should I do? I wonder
if it is easy to use SVG technology?
3x |
|
f*******4
发帖数: 345 | 3 Applet and Flash are options certainly, but both need plugins
Although SVG is W3C standard, IE doesn't support it yet.
http://www.liquidx.net/plotkit/ is one of the javascript libraries to provide cross browser graph |
|
F****n
发帖数: 3271 | 4 There is a book called graph algorithms in Java, which lists Java source
code for these kind of stuffs. It's available online I believe. Just google
it. |
|
s*******n
发帖数: 631 | 5
I mean BST and Graph..... |
|
g*****g
发帖数: 34805 | 6 TreeSet is a balanced tree. Graph may be too arbitrary to have a common
implementation. |
|
d**o
发帖数: 864 | 7 请教一个,这个graph command是什么东西? |
|
n*****g
发帖数: 274 | 8 只听过binary tree. 有binary graph这个说法嘛？ |
|
|
|
|
s*****d
发帖数: 43 | 11 extra data structure allowed?
Is graph cycle-free or not? |
|
f**n
发帖数: 401 | 12 Suppose we have a one-directional graph. Define a path as a sequence of
vertices such that from each of its vertices there is an edge to the next
vertex in the sequence. So a path of three vertices would be recorded
somehow as v1->v2->v3.
Now I need to store a set of paths that are different from each other. For
example, path 1 is v1->v2->v3, path 2 is v2->v3->v4, path 3 is v2->v4, and
so on so forth. I need a container to store path 1, 2, and 3. The number of
paths can be much bigger than the t |
|
|
r*********r
发帖数: 3195 | 14 最简单的是 list< vector< int > > 表示的 adjacency list.
boost::graph 是难懂了一点, 但底层的数据结构也就是这个 list> |
|
v****s
发帖数: 1112 | 15 im asking drawing "graph", not chart. thanks |
|
f*********m
发帖数: 726 | 16 问题是对于存在一台机器上的graph的边界节点，他的直系朋友可能存储在另一他机器
上，也就是是说，他通往直系朋友的edge被cut了。怎么处理这种情况？ |
|
c****e
发帖数: 1453 | 17 Mapreduce is not efficient for graph algorithms.
You can simply partition the adjacency list on nodeId. Since each node knows
its neighbors, the start node (A) and end node(B) can exchange their AJL to
minimize the communication to other machines. |
|
s***g
发帖数: 245 | 18 我有1800节点，也就是3600个节点。当我把这3600个节点构成一个图形graph的时候，
分成以下几步：
1）构造adjacency list
2) addvertex
3) addedge
前两步速度还可以，几秒钟就好了，可是第三步却用了4分钟，addedge真的那么慢吗？
函数如下：
public void AddEdge(int start, int eend)
{
adjMatrix[start, eend] = 1;
adjMatrix[eend, start] = 1;
} |
|
m********l
发帖数: 791 | 19 【 以下文字转载自 JobHunting 讨论区 】
发信人: mechanical (mechanics), 信区: JobHunting
标 题: Graph database 业界用的多吗？
发信站: BBS 未名空间站 (Mon Mar 3 17:19:12 2014, 美东)
也是Nosql的一种
比较流行的有neo4j, Titan这些
都有自己的query language,比如neo4j是cypher language, Titan是gremlin
大牛来说说？前景？以后业界的普及度？ |
|
g*****g
发帖数: 34805 | 20 我不懂 graph db. NoSql的实质就是 CAP 没法同时满足。根据自己应用的特征取舍。 |
|
d*******r
发帖数: 3299 | 21 请问“ 但它不是真正的分布式 ” 这个怎么讲？
都 graph based, 还不能分布到 clustered nodes 上? |
|
|
c*****c
发帖数: 564 | 23 多谢楼上的回答。
doxygen每次莫名奇妙的在test文件那停住（automated regression test）
pycallgraph 是在运行中产生，但是我缺少几个关键的软件，没法运行。
下周准备试试pysonic2。
也许这是由于python语言造成的，必须要通过运行才能产生call graph。 |
|
|
b*****t
发帖数: 26 | 25 精华版中关于如何从 Acrobat reader 4.0 中拷的方法为 : ctrl+shift+5,
本人用后方知有误。正确的是，有鼠标按住工具栏上拷贝文字的按钮
(text select tool)，不要松开向下移动，会出现实 3 个次级按钮，选第 3
（graph select tool）个即可。 |
|
C********p
发帖数: 92 | 26 试着用Facebook Graph API Explorer在没有用户permission的情况下查询信息。但一
些在Facebook官网能得到的信息，比如likes，friends等都查不到。这是为什么呢？
Facebook SDK估计也一样吧？谢谢。 |
|
n*s
发帖数: 752 | 27 how to put a graph on the right, and a paragraph on the left, the 2 aligned
with the same top line? like:
here is the normal text mode, hehe. hehe.
adsfas asdf asd fa dfasd fa |-----------|
asdfa asdfads adfas adsfaf | ^_^ |
| _ OO |
adf dfasfd adff | o^o .) |
dsfadf afddadf |-----------|
now, normal text mode again, hehe. that's
it |
|
u*******y
发帖数: 8 | 28 Hi, I am using xml to transform my object db to xml. does
anybody know how to represent graph in xml? xml is typically
hierarchical. But for my oodb, I will have a relation class,
which will represent relation between different elements.
How can I represent this in xml?
I am brand-new to xml. anybody please help! thanks. |
|
l********p
发帖数: 1234 | 29 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
w******d
发帖数: 46 | 30 I've seen some speakers animated their prism graphs column by column. I want
to try that but can't find any information about how to do that. I could
try to use white boxes to hide it first, and then remove the white boxes by
animation. but is there an easier way?
Thanks! |
|
S*********e
发帖数: 127 | 31 How to make a polar graph with column? Does Prism 6 work? |
|
l********p
发帖数: 1234 | 32 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
i********g
发帖数: 41 | 33 我的graph非常大，有400K+的nodes，1.4M+的edge。请问matlab有没有什么function，
或者哪儿能下到什么package能够算出它的diameter? |
|
l********p
发帖数: 1234 | 34 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
s*****u
发帖数: 284 | 35 我有一个二分图(Bipartite Graph)储存在邻接矩阵A里, 100行300列，100行表示100个
因素A, 300行表示300个因素B. 即为一个100*300的二分图。
现在有一个方法找到因素B的overlap，我想看看对于因素Ai 和因素Aj, 他们所链接的
因素B中有多少是相同的。
方法如下: 取A的转置T(A), 算A' = T(A)*A, 则A'[i,j]即为因素A i 和 j 链接的元素
B的个数。
这个算法我从别人听来的，可是为什么呢？能给点证明或者是给个链接说明这个算法吗？
可能我的翻译不好，大家请轻拍。 |
|
s*****u
发帖数: 284 | 36 我有一个二分图(Bipartite Graph)储存在邻接矩阵A里, 100行300列，100行表示100个
因素A, 300行表示300个因素B. 即为一个100*300的二分图。
现在有一个方法找到因素B的overlap，我想看看对于因素Ai 和因素Aj, 他们所链接的
因素B中有多少是相同的。
方法如下: 取A的转置T(A), 算A' = T(A)*A, 则A'[i,j]即为因素A i 和 j 链接的元素
B的个数。
这个算法我从别人听来的，可是为什么呢？能给点证明或者是给个链接说明这个算法吗？
可能我的翻译不好，大家请轻拍。 |
|
z****w
发帖数: 463 | 37 intro to graph theory
by West |
|
|
z*******e
发帖数: 15 | 39 Hi all,
I need to plot such types of graph in two-dimension, for example, it
could be the union of all R_rho, 0=< rho <=1, P=constant,
R_rho = {R1 <= log(1+ rho^2*P), R2 <= log(1+ (1-rho^2)*P),
R1+R2 <= log(1+ P+ 2*rho*P)}
I would like to observe the boundary of the final region.
How could I plot this boundary? I tried matlab, using command "area", but
the whole area is colored.
Are there any better ways or tools to finish this?
Thanks. |
|
D*******a
发帖数: 207 | 40 还是自己回答算了。现在找到的一个关键词是 is not unique。
用google找"signal flow graph" "is not unique" 还找到一点相关的东西。 |
|
H*********r
发帖数: 4 | 41 【 以下文字转载自 EE 讨论区 】
发信人: HoustonBear (Houston Bear), 信区: EE
标 题: 能推荐一个画Bar Graph的软件吗？
发信站: BBS 未名空间站 (Thu Jul 13 19:56:36 2006)
我试了Matlab 和 Excel,他们都是用不同颜色来区分代表不同数据的Bar.
这样的话，如果是黑白图，就区分不明显。不知道有没有软件可以画出
不同花案的Bar,例如左斜杠，右斜杠，斑点等等。谢谢， |
|
t*******2
发帖数: 8 | 42 本人需要做关于网络比较研究，具体来说，要研究多级供应链的结构。比如说，有一个
供应商,几个仓库, 几个零售店。供应商供应仓库，仓库供应零售店就形成了一个供应
网络，本人想用数学（或者从CS的角度）的方法来表示这种网络结构，并且比较网络之
间的相似性。
请有经验的朋友介绍下Graph Theory的入门级的参考书，或者相关的参考书，有下载地
址更好，谢谢大家！ |
|
s******s
发帖数: 505 | 43 How to convert the shapefile road network into a graph,
for example, in adjacency matrix or linked nodes?
Thanks! |
|
o******d
发帖数: 1552 | 44 Here is my proof:
Let k be the size of the largest clique of G. Let r be the chromatic
number of G. Let me list some claims as lemma here:
[Lemma 1] k<=r (When k==r, G is perfect.)
Here is an example of not perfect graph:
o-----o-----o
| | |
| | |
o-----o o
\ /
\-------/
where k = 2, and r = 3
Now we only need to prove that the case of r > k does not exist.
[Lemma 2] There must exist a circle C which uses r colors and |C|>=r.
Pro |
|
s***t
发帖数: 113 | 45 D. West, Introduction the graph theory. |
|
M******e
发帖数: 48 | 46 有人在做graph theory 的研究吗？
那个学校在这方面的研究比较出名？ |
|
l********p
发帖数: 1234 | 47 想买TI-84 graphing calculator , 发现都在1００多 dollars， 那里有deal for
cheap one?
thank you everyone for this advice. |
|
N*******e
发帖数: 10 | 48 If f: [a, b] -> R and if the graph G(f) = {(x, f(x)): x in [a, b]} is
connected. Does it follow that f is continuous? How to prove the conclusion?
Many Thanks! |
|
f*****e
发帖数: 2992 | 49 假设有n个node的graph，只有一个connected component.假设有m条边，具有这个特性
的图，肯定有很多是同构的。怎么把不同构的图一个一个列出来呢？然后用并行计算找
出具有最优特性的图。 |
|
n***s
发帖数: 1257 | 50 请问谁有Complex Graphs and Networks by Fan Chung and Linyuan Lu电子书下载？
谢谢 |
|
