Showing 50 open source projects for "shortest path city"

View related business solutions
  • Our Free Plans just got better! | Auth0 by Okta Icon
    Our Free Plans just got better! | Auth0 by Okta

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
    Try free now
  • Deliver secure remote access with OpenVPN. Icon
    Deliver secure remote access with OpenVPN.

    Trusted by nearly 20,000 customers worldwide, and all major cloud providers.

    OpenVPN's products provide scalable, secure remote access — giving complete freedom to your employees to work outside the office while securely accessing SaaS, the internet, and company resources.
    Get started — no credit card required.
  • 1
    NetworkX

    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”.
    Downloads: 6 This Week
    Last Update:
    See Project
  • 2
    GeoTools, the Java GIS toolkit

    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.
    Leader badge
    Downloads: 251 This Week
    Last Update:
    See Project
  • 3
    SokobanP
    Sokoban game for Windows including 8000 levels, 30 skins, level editor, undo/redo, save positions, replay.
    Leader badge
    Downloads: 29 This Week
    Last Update:
    See Project
  • 4

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Top-Rated Free CRM Software Icon
    Top-Rated Free CRM Software

    216,000+ customers in over 135 countries grow their businesses with HubSpot

    HubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
    Get started free
  • 5

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8

    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9
    MUD Map

    MUD Map

    A mapping tool for text-based games like text adventures, MUDs, etc.

    MUD Map helps users of MUDs, MUSHs, text adventures and similar games at creating maps of the virtual worlds and to keep an overview over places, paths, dangerous areas,... This repository contains the code and binaries of MUD Map v1 (deprecated!) as well as the Java binaries (jar) of MUD Map v2. More information about MUD Map v2 can be found on GitHub: https://github.com/Neop/mudmap2
    Downloads: 3 This Week
    Last Update:
    See Project
  • Bright Data - All in One Platform for Proxies and Web Scraping Icon
    Bright Data - All in One Platform for Proxies and Web Scraping

    Say goodbye to blocks, restrictions, and CAPTCHAs

    Bright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
    Get Started
  • 10

    Shortest Path Graph A star

    finds the sortest path on the directed graph using A* algorithm.

    It is the implementation of the A* algorithm for directed graph. Additionally, the implementation of the Graph is provided. For visualization of the graph and the results of the A* algorithm the data are exported in GraphViz (Graph Visualization Software) format: http://www.graphviz.org/ Various exemplary solutions are provided. See also my other two projects related to A* algorithm: https://sourceforge.net/projects/path-finder-qt/ https://sourceforge.net/projects/a-star/
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    kaon.js

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 13

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 14

    Path Finder Qt

    finds the sortest path on the square board. GUI is implemented in Qt.

    The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 15
    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 16
    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
    Downloads: 0 This Week
    Last Update:
    See Project
  • 17
    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 18
    Grapho
    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).
    Downloads: 0 This Week
    Last Update:
    See Project
  • 19
    Navigation Shortest Map Dhaval Kadia

    Navigation Shortest Map Dhaval Kadia

    Shortest Path Navigator with Directions and Distance

    Programmed on Language C. A nano-Infant of GOOGLE-MAP Optimized to Consume some MB instead of 50 GB of RAM This was Programmed Quarter Year ago in 2014
    Downloads: 0 This Week
    Last Update:
    See Project
  • 20
    Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 21
    CoGA

    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...
    Downloads: 1 This Week
    Last Update:
    See Project
  • 22
    EZreclaim

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23

    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...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    Maze Solver

    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.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    gps_chung
    gps chung is an open source GPS algorythm program. It calculates the shortest way path from start to end out of an array of road segments (position, direction) . Source code gps_chung.bi is included as example in a small application game garden_chung (freebasic) lite version of circuit_chung road circuit game with random map generation , home garden edit and gps speech voices.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • 2
  • Next