blocks|key|2831282|text|在StackOverflow类似问题推荐的帮助下，我发现了几个主题相似的问题。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2831283|第一个是Javascript+directed+acyclic+graph+library?+(Graph+visualization+is+NOT+necessary)，很接近。在这里，nrabinowitz建议你去看看data.js。我很快浏览了一下data.js的源代码。它确实提供了处理图形的接口，但只是以非常基本的方式。那里没有遍历算法。data.js的目标似乎也不只是一个全面的图形库。|offset|length|2831284|第二个问题，Javascript+library+for+graph+operations，几乎和这个问题一样，但还没有真正的答案(在2013-01-23+17:32)。作者c0dem4gnetic引用了NetworkX，这是我非常需要的，但不幸的是只能用Python语言实现。|2831285|如果我自己实现这样一个库，我会有些兴奋。图表太酷了。|2831286|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/6877091/javascript-directed-acyclic-graph-library-graph-visualization-is-not-necessary|1|https://stackoverflow.com/users/380487/nrabinowitz|2|http://quasipartikel.at/data-js/|3|https://stackoverflow.com/questions/3871821/javascript-library-for-graph-operations|4|https://stackoverflow.com/users/105040/c0dem4gnetic|5|http://networkx.github.com/^0|0|4|29|0|2M|B|1|33|7|2|0|6|13|3|2F|C|4|2U|8|5|0|0^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|12|8|@]|9|@$D|13|E|14|1|15]|$D|16|E|17|1|18]|$D|19|E|1A|1|1B]]|A|$]]|$1|F|3|G|5|6|7|1C|8|@]|9|@$D|1D|E|1E|1|1F]|$D|1G|E|1H|1|1I]|$D|1J|E|1K|1|1L]]|A|$]]|$1|H|3|I|5|6|7|1M|8|@]|9|@]|A|$]]|$1|J|3|-4|5|6|7|1N|8|@]|9|@]|A|$]]]|K|$L|$5|M|N|O|A|$P|Q]]|R|$5|M|N|O|A|$P|S]]|T|$5|M|N|O|A|$P|U]]|V|$5|M|N|O|A|$P|W]]|X|$5|M|N|O|A|$P|Y]]|Z|$5|M|N|O|A|$P|10]]]]

With help of StackOverflow's similar question recommendations I found couple questions with similar topic.

First one, <a href="https://stackoverflow.com/questions/6877091/javascript-directed-acyclic-graph-library-graph-visualization-is-not-necessary">Javascript directed acyclic graph library? (Graph visualization is NOT necessary)</a>, is close. There <a href="https://stackoverflow.com/users/380487/nrabinowitz">nrabinowitz</a> suggests checking out <a href="http://quasipartikel.at/data-js/" rel="nofollow noreferrer">data.js</a>. I quickly browsed through the source of data.js. It really gives interface for handling graphs but only in very basic manner. No traversal algorithms there. It also seems that the goal of data.js is something other than a comprehensive graph library.

Second one, <a href="https://stackoverflow.com/questions/3871821/javascript-library-for-graph-operations">Javascript library for graph operations</a>, almost same question as this but has no real answers yet (at 2013-01-23 17:32). The author <a href="https://stackoverflow.com/users/105040/c0dem4gnetic">c0dem4gnetic</a> references to <a href="http://networkx.github.com/" rel="nofollow noreferrer">NetworkX</a> which is very much what I need but unfortunately implemented only in Python.

I would be somewhat excited to implement such a library by myself. Graphs are so cool.

blocks|key|2831312|text|我们的Java+library中有算法，我们只是想找一个空闲的位置将它们添加到我们的JavaScript+library中。这对您现在没有帮助，但对以后的观众可能会有一些帮助。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2831313|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/jgraph/jgraphx|1|https://github.com/jgraph/mxgraph^0|3|C|0|16|I|1|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]|$A|R|B|S|1|T]]|C|$]]|$1|D|3|-4|5|6|7|U|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]|L|$5|G|H|I|C|$J|M]]]]

We have algos in our <a href="https://github.com/jgraph/jgraphx" rel="nofollow">Java library</a>, we're just trying to find a free slot to add them to our <a href="https://github.com/jgraph/mxgraph" rel="nofollow">JavaScript library</a>. That doesn't help you now, but might be some use to later viewers.

blocks|key|200438|text|几个月前，我用JavaScript创建了一个包含不同CS算法实现的repository。也有一些带有图的算法。我计划扩展它(生成树，启发式算法，可能是色图)，但从那时起，我认为仍然没有什么算法可以帮助你。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|200439|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/mgechev/javascript-algorithms^0|X|A|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Before few months I created a <a href="https://github.com/mgechev/javascript-algorithms" rel="nofollow">repository</a> with implementations of different CS algorithms in JavaScript. There are also few algorithms with graphs. I plan to extend it (spanning trees, heuristic algorithms probably chromatic graphs) but since then I think that there are still few algorithms which could help you.

blocks|key|2831352|text|我用javascript做了一个图形算法库https://github.com/devenbhooshan/graph.js。库是干净且非常简单的。它非常容易使用。只需将graph.js文件插入到项目中并开始使用它。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2831353|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/devenbhooshan/graph.js^0|L|15|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

I have made a graph algorithms library <a href="https://github.com/devenbhooshan/graph.js" rel="nofollow">https://github.com/devenbhooshan/graph.js</a> in javascript. Library is clean and very simple. It is very easy to use. Just plug the graph.js file in your project and start using it.

blocks|key|3043853|text|现在有了一个库：graphlib|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3043854|3043855|图形库是一个JavaScript库，它为无向多图和有向多图提供了数据结构，以及可以与之一起使用的算法。|blockquote|3043856|3043857|3043858|实施：|3043859|最短生成有向图和无向图(A+->+B是否表示B+->+A)最小生成排序多图(来自AB的多条不同命名边)排序复合图(结点可以具有形成"subgraph")|3043860|Dijkstra算法的子节点(最短路径支持负排序算法(最小生成排序算法(强连接components)|unordered-list-item|3043861|Topological排序(|3043862|+->+|3043863|)H219<所有连接的组件前遍历和后序遍历(callback+on+every+node)|style|CODE|3043864|Finding+acyclic|3043865|Finding+/code>+cycles+)以及测试图形是否已连接所有已连接组件(|3043866|3043867|3043868|支持NPM、Bower和浏览器，MIT许可证。|3043869|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/cpettitt/graphlib^0|8|8|0|0|0|0|0|0|0|0|0|0|0|1|18|0|0|F|0|0|16|0|0|0|0|N|0^^$0|@$1|2|3|4|5|6|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|D|3|-4|5|6|7|1I|8|@]|9|@]|C|$]]|$1|E|3|F|5|G|7|1J|8|@]|9|@]|C|$]]|$1|H|3|-4|5|6|7|1K|8|@]|9|@]|C|$]]|$1|I|3|-4|5|6|7|1L|8|@]|9|@]|C|$]]|$1|J|3|K|5|6|7|1M|8|@]|9|@]|C|$]]|$1|L|3|M|5|6|7|1N|8|@]|9|@]|C|$]]|$1|N|3|O|5|P|7|1O|8|@]|9|@]|C|$]]|$1|Q|3|R|5|P|7|1P|8|@]|9|@]|C|$]]|$1|S|3|T|5|P|7|1Q|8|@]|9|@]|C|$]]|$1|U|3|V|5|P|7|1R|8|@$A|1S|B|1T|W|X]]|9|@]|C|$]]|$1|Y|3|Z|5|P|7|1U|8|@$A|1V|B|1W|W|X]]|9|@]|C|$]]|$1|10|3|11|5|P|7|1X|8|@$A|1Y|B|1Z|W|X]]|9|@]|C|$]]|$1|12|3|-4|5|P|7|20|8|@]|9|@]|C|$]]|$1|13|3|-4|5|6|7|21|8|@]|9|@]|C|$]]|$1|14|3|15|5|6|7|22|8|@$A|23|B|24|W|X]]|9|@]|C|$]]|$1|16|3|-4|5|6|7|25|8|@]|9|@]|C|$]]]|17|$18|$5|19|1A|1B|C|$1C|1D]]]]

Now there is a library: <a href="https://github.com/cpettitt/graphlib" rel="noreferrer">graphlib</a>

<blockquote>
 Graphlib is a JavaScript library that provides data structures for undirected and directed multi-graphs along with algorithms that can be used with them.
</blockquote>

Implements:

<ul>
<li>directed and undirected graphs (does A -> B imply B -> A)</li>
<li>multigraphs (multiple distinct named edges from A -> B)</li>
<li>compound graphs (nodes can have children that form a "subgraph")</li>
<li>Dijkstra algorithm (shortest path)</li>
<li>Floyd-Warshall algorithm (shortest path supporting negative weights)</li>
<li>Prim's algorithm (minimum spanning tree)</li>
<li>Tarjan's algorithm (strongly connected components)</li>
<li>Topological sorting (dependency sort for directed acyclic graphs)</li>
<li>Pre- and postorder traversal (callback on every node)</li>
<li>Finding all cycles and testing if a graph is acyclic</li>
<li>Finding all connected components</li>
</ul>

NPM, Bower and browser supported, MIT license.

blocks|key|3043934|text|还有js-graph-algorithms，它看起来很干净，有几种算法。不过，它的api非常简单。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3043935|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/chen0040/js-graph-algorithms^0|2|J|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

There is also <a href="https://github.com/chen0040/js-graph-algorithms" rel="nofollow noreferrer">js-graph-algorithms</a>, which seems pretty clean and has several algorithms. Its api is pretty basic though.

blocks|key|200522|text|目前维护的也包括打字支持的折旧graphlib的替代方案是graphology。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|200523|当与graphology-shortest-path等扩展结合使用时，它似乎支持所有必需的功能。|200524|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/graphology/graphology^0|F|8|T|A|0|0|2|O|0^^$0|@$1|2|3|4|5|6|7|P|8|@$9|Q|A|R|B|C]]|D|@$9|S|A|T|1|U]]|E|$]]|$1|F|3|G|5|6|7|V|8|@$9|W|A|X|B|C]]|D|@]|E|$]]|$1|H|3|-4|5|6|7|Y|8|@]|D|@]|E|$]]]|I|$J|$5|K|L|M|E|$N|O]]]]

A currently maintained alternative to the depreciated <code>graphlib</code> that also includes Typescript support would be <a href="https://github.com/graphology/graphology" rel="nofollow noreferrer">graphology</a>.
It seems to support all the required features when combined with some extensions such as <code>graphology-shortest-path</code>.

blocks|key|2831444|text|下面是用JavaScript实现的Tarjan的强连接组件算法：https://www.vacilando.org/article/javascript-implementation-tarjans-cycle-detection-algorithm|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2831445|entityMap|0|LINK|mutability|MUTABLE|url|https://www.vacilando.org/article/javascript-implementation-tarjans-cycle-detection-algorithm^0|W|2L|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

Here's Tarjan's strongly connected components algorithm implemented in JavaScript: <a href="https://www.vacilando.org/article/javascript-implementation-tarjans-cycle-detection-algorithm" rel="nofollow noreferrer">https://www.vacilando.org/article/javascript-implementation-tarjans-cycle-detection-algorithm</a>

What I need is a JavaScript implementation of <a href="http://en.wikipedia.org/wiki/Graph_%28mathematics%29">pure mathematical graphs</a>. To be clear I DON'T mean graph visualization libraries like <a href="http://sigmajs.org/">sigma.js</a> or <a href="http://bl.ocks.org/4062045">d3.js</a>.

The library I'm looking for would implement following features:

<ul>
<li>creation of directed and undirected graph objects</li>
<li>creation of weighted and unweighted graps objects</li>
<li>adding/removing vertices and edges to/from the graph</li>
<li>adding labels to vertices and edges (i.e. additional meta data)</li>
<li>implementation of basic graph search and traversal algorithms like <a href="http://en.wikipedia.org/wiki/Depth-first_search">depth-first-search</a>, <a href="http://en.wikipedia.org/wiki/Breadth-first_search">breadth-first search</a>, <a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">Dijkstra's algorithm</a>, <a href="http://en.wikipedia.org/wiki/A%2a_search_algorithm">A*</a> and <a href="http://en.wikipedia.org/wiki/Graph_traversal">others</a>.</li>
</ul>

Does anyone know if one already exists?

Is there any JavaScript libraries for graph operations and algorithms?

数据结构

Python

我需要的是的JavaScript实现。需要说明的是，我指的不是像或这样的图形可视化库。我正在寻找的库将实现以下功能：为图创建有向图和无向图的有向图和无向图objectscreation objectsadding/removing顶点和边的加权和未加权图为顶点和边添加标签(即，、、、和等基本图搜索和遍历算法的附加元图有...

问有没有用于图形操作和算法的JavaScript库？
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问有没有用于图形操作和算法的JavaScript库？EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问有没有用于图形操作和算法的JavaScript库？
EN