- 120

The .Net Graph Library makes it easy for developers to create, traverse, analyze and solve problems related to graphs.

http://graphlib.codeplex.com/Tags | graph graph-theory shortest-path |

Implementation | |

License | Apache |

Platform | Windows |

In graph algorithms, the widest path problem, also known as the bottleneck shortest path problem or the maximum capacity path problem, is the problem of finding a path between two designated vertices in a weighted directed graph, maximizing the weight of the minimum-weight edge in the path. For instance, if the graph represents connections between routers in the Internet, and the weight of an edge represents the bandwidth of a connection between two routers, the widest path problem is the proble

A library for graph algorithms (shortest-path, spanning tree, ...)

Shortest path in directed unweighted graph from one node to other node

A* ruby implementation to find shortest path and map in a graph.

The Graph Implementation and Representation Libraries, or GIRLs, aim to be all-purpose libraries for solving graph theory problems. ie, shortest paths, matching, cycles, connectedness, creating 'random' graphs, etc...

boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)

OSPF? uses? a? graph?theoretic? model? of? network? topology? to? compute? shortest? paths.? Each? router? periodically? broadcasts? information? about? the? status? of? its? connections.? OSPF? floods? each? status? message? to? all? participating? routers.? A? router? uses? arriving? link? state? information?to?assemble?a?graph.?Whenever?a?router?receives?information?that?changes?its?copy?of?the? topology? graph,? it? runs? a? conventional? graph? algorithm? to? compute? shortest? paths? in? t

* [almende/vis](https://github.com/almende/vis) - Dynamic, browser-based visualization library http://visjs.org* [anvaka/ngraph](https://github.com/anvaka/ngraph) - Beautiful Graphs* [anvaka/VivaGraphJS](https://github.com/anvaka/VivaGraphJS) - Graph drawing library for JavaScript* [cpettitt/dagre](https://github.com/cpettitt/dagre) - Directed graph renderer for javascript* [cytoscape/cytoscape.js](https://github.com/cytoscape/cytoscape.js) - An open-source JavaScript graph theory library for an

Dot2Silverlight is a project thats enables to render graphs (written in Dot format) in Silverlight. dot2silverlight, dot, silverlight, C#, graphviz, xdot, plain, layout graphs, shortest path

dot graph graph-layout graphviz silverlight-3Convert an ESRI shapefile to a network graph represenation, suitable for shortest path and other standard graph theoretic computations

Just me fucking around with Graph Theory, that's all.

Writing rigourous proofs in graph theory with sets.

K Shortest Path Implementation of Yin's Algorithm using JGraphT API

WPFGraph is a tool to create animations of graph algorithms using a WPF based 3D rendering engine. You can create a graph by adding nodes and edges to the UI simply by using your mouse. Then you can execute a graph algorithm like Dijkstra on the created graph.

algorithms animation graph graph-theory wpf-3d