Displaying 1 to 20 from 22 results

networkx - Official NetworkX source code repository.

  •    Python

NetworkX is a Python package for the creation, manipulation, and study of the structure, dynamics, and functions of complex networks. For additional details, please see INSTALL.rst.

cytoscape

  •    Javascript

Cytoscape.js is a fully featured graph theory library. Do you need to model and/or visualise relational data, like biological data or social networks? If so, Cytoscape.js is just what you need. Cytoscape.js contains a graph theory model and an optional renderer to display interactive graphs. This library was designed to make it as easy as possible for programmers and scientists to use graph theory in their apps, whether it's for server-side analysis in a Node.js app or for a rich user interface.

Snake - Artificial intelligence of the Snake game.

  •    Python

This project focuses on the artificial intelligence of the Snake game. The snake's goal is to eat the food continuously and fill the map with its bodies ASAP. The old version of this project is written in C++. Now it has been rewritten using Python for a user-friendly GUI and the simplicity in the implementations of algorithms. Requirements: Python 3.5+ with Tkinter installed.

Graph - Graph is a semantic database that is used to create data-driven applications.

  •    Swift

Graph is a semantic database that is used to create data-driven applications. Embedded frameworks require a minimum deployment target of iOS 8 or OS X Yosemite (10.10).




mgmt - Next generation distributed, event-driven, parallel config management!

  •    Go

Mgmt is a next generation automation tool. It has similarities to other tools in the configuration management space, but has a fast, modern, distributed systems approach. The project contains an engine and a language. Please have a look at an introductory video or blog post. Mgmt is a fairly new project. It is usable today, but not yet feature complete. With your help you'll be able to influence our design and get us to 1.0 sooner! Interested developers should read the quick start guide.

jGraphT - Java graph library

  •    Java

JGraphT is a Java graph library that provides mathematical graph-theory objects and algorithms. It includes directed, undirected, weighted, unweighted etc. Graphs could be created based on Strings, URLs, XML documents.


.Net Neo4j Rest Client

  •    

Neo4jRestSharp is a .Net client for the Neo4j Rest Server. Neo4j is an open sourced java based transactional graph database that stores data structured in graphs rather than in tables.

.NET Graph Library

  •    

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

WPFGraph

  •    

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.

JUNG: Java Universal Network/Graph Framework

  •    Java

JUNG is a software library that provides a common and extensible language for the modeling, analysis, and visualization of data that can be represented as a graph or network. Its basis in Java allows JUNG-based applications to make use of the extensive built-in capabilities of the Java API, as well as those of other existing third-party Java libraries.

LightGraphs.jl - An optimized graphs package for Julia

  •    Julia

Until an issue with one of our dependencies is resolved, LightGraphs will not work with any Julia 0.7 or 1.0 version that has been built from source on OSX or other systems with a compiler more modern than GCC7. If you use LightGraphs with Julia 0.7 or 1.0, please download a Julia binary. LightGraphs offers both (a) a set of simple, concrete graph implementations -- Graph (for undirected graphs) and DiGraph (for directed graphs), and (b) an API for the development of more sophisticated graph implementations under the AbstractGraph type.

graph - Library of basic graph algorithms

  •    Go

Topological ordering, image by David Eppstein, CC0 1.0.The algorithms can be applied to any graph data structure implementing the two Iterator methods: Order, which returns the number of vertices, and Visit, which iterates over the neighbors of a vertex.

Graph - A mathematical graph library for javascript

  •    Javascript

Graph is a mathematical graph library. It is designed to be a functional, stand-alone, light-weight library for general purpose graph processing. Definitions are taken from the Wikipedia glossary of mathematical graph theory. That's a great place to start to get a basic understanding of graph theory. The documentation in this library includes both the Wikipedia definitions and the the implemetation details.

Puzzle - Artificial intelligence of the 25-puzzle game based on A* search.

  •    Javascript

Artificial intelligence of the n-puzzle (n=25) game based on A* search. See the LICENSE file for license rights and limitations.

JuliaGraphsTutorials - Tutorials in the form of Jupyter notebooks for the JuliaGraphs ecosystem

  •    Jupyter

Tutorials in the form of Jupyter notebooks for the JuliaGraphs ecosystem. Please let us know if any of the notebooks are outdated or not functioning with the current release of LightGraphs.jl. Contributions are very welcome, please submit a pull request or open an issue with an example that you feel is missing.

pkgnet - R package for analyzing other R packages via graph representations of their dependencies

  •    R

The core functionality of this package is the CreatePackageReport function. To report bugs, request features, or ask questions about the structure of the code, please open an issue.

Graph-Theory-Ford-Fulkerson-Maximum-Flow - Ford-Fulkerson Algorithm for Maximum Flow Problem Written in JS

  •    Javascript

Compute the maximum flow in a flow network between source node source and sink node sink. Returns: Returns a number representing the maximum flow.