Search Results for "shortest path city"
Sort By:
Showing 39 open source projects for "shortest path city"
View related business solutions-
Drive amazing product experiences with quality product data.
-
As your users rely more and more on Cloud and Internet-based technologies, reliable internet connectivity becomes more and more important to your business. With Bigleaf’s proven SD-WAN architecture, groundbreaking AI, and DDoS attack mitigation, you can finally deliver the reliable internet connectivity your business needs without the limitations of traditional networking platforms. Bigleaf’s Cloud Access Network and plug-and-play router allow for limitless control to and from anywhere your traffic needs to go. Bigleaf’s self-driving AI automatically identifies and adapts to any changing circuit conditions and traffic needs—addressing issues before they impact your users. Bigleaf puts you in the driver’s seat of every complaint and support call with full-path traffic and network performance data, delivered as actionable insights, reports, and alerts.
-
1
NetworkX
Network analysis in Python
... with over 90% code coverage. Additional benefits from Python include fast prototyping, easy to teach, and multi-platform. Find the shortest path between two nodes in an undirected graph. Python’s None object is not allowed to be used as a node. It determines whether optional function arguments have been assigned in many functions. And it can be used as a sentinel object meaning “not a node”. -
2
GeoTools, the Java GIS toolkit
Toolkit for working with and mapping geospatial data
GeoTools is an open source (LGPL) Java code library which provides standards compliant methods for the manipulation of geospatial data. GeoTools is an Open Source Geospatial Foundation project. The GeoTools library data structures are based on Open Geospatial Consortium (OGC) specifications. -
3
Curve Ensemble
Curve Ensemble, a tool to manage and create curves
... on the same canvas. * Transformation tools (translate, rotate, scale). * Elaborate painting capabilities. There are also other useful methods implemented, like Lines, Circles and DataBalls, and tools for subdivision and shortest/smoothest path through data balls. Usage is now fully documented in a 27-page manual, Curve_Ensemble_manual.pdf. -
4
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
Innago is a free and easy-to-use property management solution. Whether you have 1 unit or 1000, student housing, or commercial properties, Innago is built for you. Our software is designed to save you time and money, so you can spend more time doing the things that matter most.
-
5
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for reducing... -
6
PsoPath
Particle Swarm Optimization algorithm for the shortest path problem
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate inside... -
7
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. Development takes place at https://github.com/zfoxer/AcoPath -
8
kaon.js
Kaon.js is a react isomorphic app solution
Kaon.js is an react isomorphic app solution. it contains webpack build, hot reloading, code splitting and server-side rendering. Kaon is a Decepticon-controlled city-state in the southern hemisphere of Cybertron. Under Decepticon rule, its capitol is the fortress of Kolkular. Config is a js file that default exported a Javascript object, it specified a lot ot configurations. The default path is <project_root>/config/kaon.config.js. But you can put it into anywhere of your project. -
9
BioNet-Finder
Network-based modeling and analysis for complex biological data
..., genomic complexity, latent effects on the observed system, and output ranking. This is carried out applying network analysis methods from different fields, such as Structural Equation Modeling (SEM), together with data reduction algorithms (e.g., random walkers, spectral analysis, shortest path-based or topology-based algorithms). The BioNet-Finder project is at its initial steps, and it will continuously update with new methods and code. -
BrightGauge, a ConnectWise solution, was started in 2011 to fill a missing need in the small-to-medium IT Services industry: a better way to manage data and provide the value of work to clients. BrightGauge Software allows you to display all of your important business metrics in one place through the use of gauges, dashboards, and client reports. Used by more than 1,800 companies worldwide, BrightGauge integrates with popular business solutions on the market, like ConnectWise, Continuum, Webroot, QuickBooks, Datto, IT Glue, Zendesk, Harvest, Smileback, and so many more. Dig deeper into your data by adding, subtracting, multiplying, and dividing one metric against another. BrightGauge automatically computes these formulas for you. Want to show your prospects how quick you are to respond to tickets? Show off your data with embeddable gauges on public sites.
-
10
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
11
Please cite our paper if you decide to use the code. The paper details are: Sibo Wang, Xiaokui Xiao, Yin Yang, Wenqing Lin. Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks. Proceedings of the VLDB Endowment (PVLDB), 10(2): 61-72, 2016. In this project, we included the source code (COLA_code.zip) and the datasets, query sets we used in the experiments (COLA_datasets.zip). To see the files in the project, click "Browse All Files...
-
12
A modeling and simulation tool for Routing problems on Graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulating a variety of real world routing solutions: Shortest path, TSP, VRP, VRP-TW. Check Git repository. https://github.com/guilhebl/routerapp
-
13
The min cost is a program which is going to find the minimum cost or path of any given numbers. if you have a certain set of numbers this program is going to calculate the optimized cost for that set. Similarly, the program can perform Dijkstra's algorithm which is an algorithm for finding the shortest paths between nodes in a graph by simply insert the node distance in the input file and output the shortest path in output file. The program was written in C++ using a main algorithm of a heap...
-
14
A educational Java software featuring a graph editor and algorithms animation to learn how the algorithms work. Algorithms: Breadth First Search (BFS), Depth First Search (DFS), Minimum Spanning Tree (Prim), Single-Source Shortest Path (Dijkstra), Maximum Flow (Edmonds-Karp).
-
15
CoGA
R package for differential co-expression analysis
CoGA (Co-expression Graph Analyzer) is an R package to identify differentially co-expressed gene sets between two phenotypes. The software infers gene regulatory networks from gene expression data, and compares structural properties of the inferred networks based on their spectrum distributions. It also compares the networks in terms of their gene centralities, clustering coefficients and shortest path lengths. In addition to the differential co-expression analyses, the tool provides graphical... -
16
EZreclaim
Reclaim space taken by duplicate files
Reclaim space taken by duplicate files. With the option of Deleting or replacing duplicate files with hard links. CAUTION : MAKE SURE YOU HAVE A BACKUP OF YOUR DATA BEFORE RUNNING THIS PROGRAM. NEVER RUN AGAINST SYSTEM FILES OR FOLDERS AS YOUR SYSTEM MAY BE PERMANENTLY DAMAGED. -
17
xPyder PyMOL Plugin
Analyze and visualize coupled residues and their networks in proteins
xPyder is a PyMOL plugin to analyze and visualize on the 3D structure dynamical cross-correlation matrices (DCCM), linear mutual information (LMI), communication propensities (CP), intra- and inter-molecular interactions (e.g. PSN), and more, to produce highly customizable publication-quality images. xPyder identifies networks (using concepts from graph theory, such as hubs and shortest path searching), compares matrices and focuses the analysis on relevant information by filtering the data... -
18
Maze Solver
Solves mazes
... the shortest path) or the Breadth-first search algorithm (gives you the shortest path). Building requirements: You compiler needs to support C++ 11 if your compiling the C++ version. You compiler needs to support C99 if your compiling the C version. -
19
AI Path
AI Pathfinding Presentation
Presentation of pathfinding algorithms Howto: 1. Create Map (manual or use Map -> Rapid Deployment) 2. Select start point 3. Select end point 4. Choose alg 5. Click Path -> Find -
20
APS SLC Layout
Evaluation of APS accessibility in downtown Salt Lake City
Audible Pedestrian Signals (APS) provide aid to the visually impaired at intersections by generating an audible noise that guides the pedestrian through a crosswalk. The effectiveness of these signals, however, is potentially undermined by their placement if planning considerations do not maximize their use. One hundred and twelve blocks of the downtown Salt Lake City area were inventoried in the months of November and December of 2013. Over 500 possible paths were then measured and compared... -
21
C# OO Implementation of Dijkstra's algorithm aimed at finding the path with the minimum cost. It now supports finding the shortest paths from the source vertex to every other vertex. The C# source files are now available.
-
22
This is the code used in the experiments of the following paper: Lingkun Wu, Xiaokui Xiao, Dingxiong Deng, Gao Cong, Andy Diwen Zhu, Shuigeng Zhou: Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation. PVLDB 5(5): 406-417 (2012) Please cite the paper if you choose to use the code
-
23
this simple application can determine the shortest path between two vertices given a directed/undirected graph
-
24
The knight-path program is used to find shortest path of a knight chess piece between two chess board positions.
-
25
BHeap/FHeap (Dijsktra's)
Dijsktra's Shortest path algorithm implementation
Development of FHeap and BHeap data structures Implemenation of Dijsktra's shortest path algorithm using Simple/FHeap/BHeap strategies