- 0

Algorithm and data-structure library for .NET 3.5 and up. Algorithmia contains sophisticated algorithms and data-structures like graphs, priority queues, command, undo-redo and more.

http://algorithmia.codeplex.com/Tags | algorithm command-pattern datastructure graph |

Implementation | DotNet |

License | BSD |

Platform | Windows |

%{_pearname} - graph datastructure manipulation library

This is the Repository for my Algorithm and Datastructure Exercises

Command line utility using the FBX SDK to convert FBX/Collada/Obj files to more runtime friendly formats. The FBX content is parsed into an in-memory datastructure. Pluggable writers then take this datastructure to generate the output. Send us a pull request if you want the writer for your engine/framework/app to be integrated. We'll build the converter for Windows, Linux and Mac.The FBX parser is largely based on GamePlay SDK's encoder. We'll try to back-port any bug fixes or improvements.

code for design pattern lesson: command pattern

jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.

* [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

The Graph Object Language and Layout Editor is a javascript graph visualization and layout tool. The graph is generated by parsing graph content data (using the GOLL-E Content Language specifications) that is input through a file and laying out the graph contents using a layout algorithm. The graph is then rendered and visualized and the user is able to modify the layout. by dragging the graph elements around. The user will also be able to edit the graph content while using the visualizer by usi

Exercise in using the Command design pattern

Graph::Kruskal - Kruskal's algorithm for Minimal Spanning Trees in graphs

force directed graph layout algorithm with dynamic mutation

Implementation of a force-based algorithm for calculating graph layout.

example of implementation dijkstra graph search algorithm in Scala

G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.

GrabCut is an image segmentation method based on graph cuts. The algorithm was designed by Carsten Rother, Vladimir Kolmogorov & Andrew Blake from Microsoft Research Cambridge, UK. in their paper, "GrabCut": interactive foreground extraction using iterated graph cuts . An algorithm was needed for foreground extraction with minimal user interaction, and the result was GrabCut.This program use OpenCV library. It is not use GPU in IOS. it is obviously more slower than library that it use GPU. So I want to improve this code to use GPU like GPUImage.

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