图ADT [英] graph ADT

问题描述

嗨


在

javascript中实现无向加权图ADT的最佳方法是什么？

Hi

What is the best way to implement a undirected weighted graph ADT in
javascript?

推荐答案

********* ***@gmail.com 于2006年4月6日在comp.lang.javascript中写道 ：

An************@gmail.com wrote on 06 apr 2006 in comp.lang.javascript:

实施a的最佳方式是什么？无效的加权图ADT在
javascript中？

What is the best way to implement a undirected weighted graph ADT in
javascript?

告诉我们你在说什么？


-

Evertjan。

荷兰。

（请在我的电子邮件地址中将x'变为点数）

Telling us what you are talking about?

--
Evertjan.
The Netherlands.
(Please change the x''es to dots in my emailaddress)

抱歉


我正在写一个firefox的扩展程序，我想对所有链接进行评分

用户访问的页面然后将这些信息存储在加权的

图表中（等级为edge，uri作为节点），以便能够找到

best。页面上的链接或计算路径的中间等级

用户访问过的页面等等。


我想知道的是如何以最有效的方式在

javascript中实现图形数据结构（性能明智，以及一些

范围内存也是如此）。我正在考虑使用邻接矩阵

，但它可能会稀疏，因为网上的大多数网址都没有相互连接，我想知道是否有人一个更好的主意。

Sorry

I''m writing an extension to firefox where I want to grade all links on
the pages the user visits and then store this information in a weighted
graph (grade as edges, uri as nodes), to make it possible to find the
"best" link on the page or calculate the median grade of the path
between to pages the user has visited, etc.

What I want to know is how to implement the graph datastructure in
javascript in the most efficient way (performance wise and to some
extent also memory wise). I was thinking on using an adjacency matrix
but it would probably be to sparse since most urls on the web are not
connected to each other, and I wonder if someone had an better idea.

************ @ gmail.com 于2006年4月6日在comp.lang.javascript中写道 ：

An************@gmail.com wrote on 06 apr 2006 in comp.lang.javascript:

对不起


请引用您所回复的内容。如果您想通过

groups.google.com发布跟进，请不要使用回复。链接在文章的底部。

点击显示选项在文章的顶部，然后点击

回复在文章标题的底部。

< http://www.safalra.com/special/googlegroupsreply/>

我正在写一个扩展名我想在用户访问的页面上对所有链接进行评分，然后将这些信息存储在加权的图表中（等级为边缘，uri作为节点），以便能够找到
最佳页面上的链接或计算用户访问过的页面之间的路径的中位数等等。


客户可以绘制图表，

但应该是跨浏览器设计的。


2003年我的IE示例：


< http：// devrijehuisarts.org/test/jsgraph.asp>

我想知道的是如何以最有效的方式在
javascript中实现图形数据结构（性能明智和某些
程度也记忆明智）。我正在考虑使用邻接矩阵
但它可能是稀疏的，因为网上的大多数网址都没有相互连接，我想知道是否有人有更好的想法。

Sorry
Please quote what you are replying to. If you want to post a followup via
groups.google.com, don''t use the "Reply" link at the bottom of the article.
Click on "show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.
<http://www.safalra.com/special/googlegroupsreply/>

I''m writing an extension to firefox where I want to grade all links on
the pages the user visits and then store this information in a weighted
graph (grade as edges, uri as nodes), to make it possible to find the
"best" link on the page or calculate the median grade of the path
between to pages the user has visited, etc.
Clientside drawing of graphs is possible,
but should be carfully cross-browser designed.

An IE example of mine from 2003:

<http://devrijehuisarts.org/test/jsgraph.asp>

What I want to know is how to implement the graph datastructure in
javascript in the most efficient way (performance wise and to some
extent also memory wise). I was thinking on using an adjacency matrix
but it would probably be to sparse since most urls on the web are not
connected to each other, and I wonder if someone had an better idea.

''图表数据结构''和''邻接矩阵''，你需要这样的野兽吗？


-

Evertjan。

荷兰。

（请在我的电子邮件地址中将x'变为点数）

''Graph datastructures'' and ''adjacency matrices'', do you need such beasts?

--
Evertjan.
The Netherlands.
(Please change the x''es to dots in my emailaddress)

这篇关于图ADT的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！