ngraph.path - Path finding in a graph

  •        175

Fast path finding for arbitrary graphs. Play with a demo or watch it on YouTube. If you want to learn how the demo was made, please refer to the demo's source code. I tried to describe it in great details.



Related Projects

SOTA-Py - A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem

  •    Python

SOTA-Py is a Python-based solver for the policy- and path-based "SOTA" problems, using the algorithm(s) described in Tractable Pathfinding for the Stochastic On-Time Arrival Problem (also in the corresponding arXiv preprint) and previous works referenced therein. What is the SOTA problem? Read on...

ngraph - nGraph is an open source C++ library, compiler and runtime for Deep Learning frameworks

  •    C++

Welcome to the open-source repository for the Intel® nGraph™ Library. Our code base provides a Compiler and runtime suite of tools (APIs) designed to give developers maximum flexibility for their software design, allowing them to create or customize a scalable solution using any framework while also avoiding device-level hardware lock-in that is so common with many AI vendors. A neural network model compiled with nGraph can run on any of our currently-supported backends, and it will be able to run on any backends we support in the future with minimal disruption to your model. With nGraph, you can co-evolve your software and hardware's capabilities to stay at the forefront of your industry. The nGraph Compiler is Intel's graph compiler for Artificial Neural Networks. Documentation in this repo describes how you can program any framework to run training and inference computations on a variety of Backends including Intel® Architecture Processors (CPUs), Intel® Nervana™ Neural Network Processors (NNPs), cuDNN-compatible graphics cards (GPUs), custom VPUs like Movidius, and many others. The default CPU Backend also provides an interactive Interpreter mode that can be used to zero in on a DL model and create custom nGraph optimizations that can be used to further accelerate training or inference, in whatever scenario you need.

VivaGraphJS - Graph drawing library for JavaScript

  •    Javascript

VivaGraphJS is designed to be extensible and to support different rendering engines and layout algorithms. Underlying algorithms have been broken out into ngraph. The larger family of modules can be found by querying npm for "ngraph".

l1-path-finder - 🗺 Fast path planning for 2D grids

  •    Javascript

A fast path planner for grids. The input to the library is in the form of an ndarray. For more information on this data type, check out the SciJS project.

PathFinding.js - A comprehensive path-finding library for grid based games

  •    Javascript

The aim of this project is to provide a path-finding library that can be easily incorporated into web games. It may run on Node.js or the browser. Note that this project only provides path-finding algorithms for 2D space. If you need to work in a 3D environment, then you may use @schteppe's fork.

AStar Sample WPF Application by Ben Scharbach

  •    DotNet

The A* Pathfinding component contains an A* Manager, with three A* path finding engines, allowing for 3 simultaneous path searches on PC and XBOX. - By Ben - 2d visualization of npm

  •    Javascript

Visualization of npm shows dependency graph of an npm package. Note, due to the website talks with npm registry through heroku-hosted proxy. This may have negative impact on latency.

ngraph - Beautiful Graphs


Ngraph is a set of graph related algorithms. It can be used in a browser or on the server side. This repository is a collection of examples, which show how to use some of them or build your own. At the core of the library is ngraph.graph package, which simply represents a graph data structure.

Argorha pathfinding

  •    C++

Argorha Pathfinding is an algorithm which permit you to find your way into a polygon soup ( 3D world ) efficently by precalculating a system of sectors and portals. AStar included. Demo in Download section, code on SVN.

dijkstras-algorithm - Implementations of Dijkstra's shortest path algorithm in different languages

  •    Java

Implementations of Dijkstra's shortest path algorithm in different languages. Head over to to learn about implementing Dijkstra's algorithm. You can also learn about unit testing by visiting

javascript-astar - A* Search / Pathfinding Algorithm in Javascript

  •    Javascript

A* Search / Pathfinding Algorithm in Javascript

pgRouting - Extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality

  •    C

pgRouting extends the PostGIS / PostgreSQL geospatial database to provide geospatial routing functionality. Data and attributes can be modified by many clients, like QGIS through JDBC, ODBC, or directly using Pl/pgSQL. The clients can either be PCs or mobile devices. Data changes can be reflected instantaneously through the routing engine. There is no need for precalculation. The “cost” parameter can be dynamically calculated through SQL and its value can come from multiple fields or tables.

E* Interpolated Graph Replanner

  •    C++

The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.

SwiftPriorityQueue - A Generic Priority Queue in Pure Swift

  •    Swift

SwiftPriorityQueue is a pure Swift (no Cocoa) implementation of a generic priority queue data structure, appropriate for use on all platforms (macOS, iOS, Linux, etc.) where Swift is supported. It features a straightforward interface and can be used with any type that implements Comparable. It utilizes comparisons between elements rather than separate numeric priorities to determine order. Internally, SwiftPriorityQueue uses a classic binary heap, resulting in O(lg n) pushes and pops. It includes in-source documentation, an A* based example maze solving program (for macOS), and unit tests (pull requests are welcome for additional unit tests in particular).

ObjectGraph-Xcode - ObjectGraph can show oriented graph of dependencies between classes in your project

  •    Objective-C

ObjectGraph can show oriented graph of dependencies between classes in your project. This plugin is based on objc_dep and Graphviz. The default path of source code parsing is project root path, you can set new path by clicking "Set Source Path Path...". For example, if you just want to parse your product class, not test class or external library class in Pods directory, you can set path to directory which contains your product class and execute "Draw Object Graph" again.

canvas - Cairo in Go: vector to raster, SVG, PDF, EPS, WASM, OpenGL, Gio, etc.

  •    Go

Canvas is a common vector drawing target that can output SVG, PDF, EPS, raster images (PNG, JPG, GIF, ...), HTML Canvas through WASM, OpenGL, and Gio. It has a wide range of path manipulation functionality such as flattening, stroking and dashing implemented. Additionally, it has a text formatter and embeds and subsets fonts (TTF, OTF, WOFF, WOFF2, or EOT) or converts them to outlines. It can be considered a Cairo or node-canvas alternative in Go. See the example below in Figure 1 for an overview of the functionality. Figure 1: top-left you can see text being fitted into a box, justified using Donald Knuth's linea breaking algorithm to stretch the spaces between words to fill the whole width. You can observe a variety of styles and text decorations applied, as well as support for LTR/RTL mixing and complex scripts. In the bottom-right the word "stroke" is being stroked and drawn as a path. Top-right we see a LaTeX formula that has been converted to a path. Left of that we see an ellipse showcasing precise dashing, notably the length of e.g. the short dash is equal wherever it is on the curve. Note that the dashes themselves are elliptical arcs as well (thus exactly precise even if magnified greatly). To the right we see a closed polygon of four points being smoothed by cubic Béziers that are smooth along the whole path, and the blue line on the left shows a smoothed open path. On the bottom you can see a rotated rasterized image. The result is equivalent for all renderers (PNG, PDF, SVG, etc.).

SublimeFixMacPath - A Sublime Text 2/3 plugin to set the PATH correctly on OS X

  •    Python

On OS X, Sublime Text has its PATH set by launchctl, not by your shell1. Commands like make run by Sublime Text are then unable to find non-system binaries, including those installed by homebrew and MacPorts. Fix Mac Path is a simple plugin for Sublime Text 2 and 3 which sets Sublime Text's PATH to that reported by your shell. Now, if you add homebrew's /usr/local/bin directory to your PATH in .bash_profile (or whatever other way you set your shell's PATH,) Sublime Text will inherit that PATH.

Wireless Routing using Dijkstra's Shortest Path Algorithm


Explains Dijkstra's shortest path algorithm, for wireless network routing. The users can create a random map with dynamic transmission range and choose a source and destination mobile node (by clicking) in the map and see the shortest path visually in the Silverlight output.

Quivers and Path Algebras


This is a project for developing a GAP package for doing computations with finite dimensional quotients of path algebras, and finitely generated modules over such algebras. The system design of QPA was initiated by E. Green, L. Heath and C. Struble. The current version of the QPA package has the basic features for creating a program that can do a variety of computations for finite dimensional qoutients of path algebras. In particular, it has data structures for quivers, quotients of path a

We have large collection of open source products. Follow the tags from Tag Cloud >>

Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.