215 skills found · Page 3 of 8
ddrake / Haskell DijkstraA Haskell implementation of Dijkstra's algorithm
JuanCarlosCardona / DijkstraAlgorithmVisualizationA visual representation of Dijkstra's Algorithm using Libgdx.
nohd0 / DijkstrasMATLAB implementation of Dijkstra's Algorithm
jansm04 / Dijkstra VisualizerA graph visualization tool that can simulate Dijkstra's famous shortest path algorithm.
dhruvabhat24 / GPS NAVIGATOR"GPS Navigator: Your efficient travel companion! Utilize Dijkstra's algorithm for shortest routes, making travel planning a breeze with HTML, CSS, and JavaScript. Easy, accurate, hassle-free navigation."
HozefaRauf / DSA Project Online Ecommerce StoreIt is DSA end semester project. It is developed using Arrays, LinkedList, Graphs, AVL (Adelson-Velsky and Landis) tree, Dijkstra’s algorithm, Prim's algorithm
AkashKV-1998 / Warehouse Management SystemThe successful and effective management of a busy and complex warehouse relies upon the control and location of stock within the warehouse. It is essential that stock is located in the most suitable locations, to optimize storage capability and increase resource efficiency. It is critical that the warehouse team has control and visibility at all times. A warehouse needs to be defined in multiple ways to reflect your individual characteristics, with your own location descriptions. The warehouse management system is a combinatorial optimization problem, where given a map (a set of racks and their positions in a warehouse), one wants to find an order for visiting the corresponding racks in such a way that the distance is minimal. Warehouse operational costs are heavily influenced by the efficiency in which workers are able to traverse the warehouse and gather items on orders around the warehouse that must be shipped to customers. The act of traversing the warehouse is greatly optimized by finding a shortest path possible to collect the order from the specified rack position .The main goal of Warehouse Management System is to ensure consistent availability of supplies for consumers. In general, there are two issues in optimizing a system: where in the warehouse each rack should be located and also to find an optimized possible path to retrieve the order. Therefore, we propose an implementation of a warehouse management system based on Dijkstra’s Algorithm to find the best shortest path.
agabani / DijkstraAlgorithmC# library implementation of Dijkstra's algorithm with graph builder.
geocrystal / DijkstraDijkstra's algorithm using a priority queue in Crystal
srrcboy / Dijkstra CUDADijkstra's Algorithm implemented in C/C++ using standard C, OpenMP and CUDA
harshitsingh4321 / Indore Route PathfinderIndore Route Pathfinder is a full-stack web application that helps users plan the most efficient routes across Indore. It allows dynamic location creation, connects places with custom distance and cost, and finds the shortest/cheapest path using Dijkstra’s algorithm. Built with React, Node.js, Express, and MongoDB. Deployed with Vercel and Render.
AAArpan / Autonomous Navigation And Path Planning On ROS2 Using Dijkstra And SLAMThis is the implementation of an autonomous navigation project using TurtleBot3 in a custom Gazebo world. The project integrates ROS 2 Humble, SLAM Toolbox, and a custom Dijkstra’s algorithm for path planning. The goal is to simulate a robot navigating through a maze-like environment, avoiding obstacles, and reaching its destination efficiently.
N3evin / Dijkstra Algorithm UnityShortest path finding using Dijkstra's Algorithm in unity
aolszak / AOShortestPathImplementation of shortest path algorithm in Objective-C for iOS - based on Dijkstra's algorithm.
jasondavies / Smoothsort.jsA JavaScript implementation of Dijkstra's smoothsort algorithm.
schostac / Algorithms On GraphsAdvanced Shortest Paths, Bidirectional Dijkstra, A* Algorithm, Contraction Hierarchies, TSP, Kruskal's MST, Bipartite Graph, SCC, Shortes-Path Tree, BFS, Topological Sort, DFS.
fedelebron / DijkstraA small implementation of Dijkstra's algorithm, as implemented to find shortest paths between cities.
crazykeyboard / Graph AdjList DijkstraIn a adjacent list Graph, find the shortest path between two Nodes by Dijkstra's algorithm.
hamidaucc / Link State Protocol In PythonThis project implenments the OSPF using Dijkstra algorithm (Open Shortest Path First) network protocol in python. Link-State Routing protocol is a main class of routing protocols. It is performed by every switching node/router in the network. The basic concept of link-state routing is that every node constructs a map of the connectivity to the network, in the form of a Graph, showing which nodes are connected to which other nodes. Each node then independently calculates the next best logical path from it to every possible destination in the network. The collection of best paths will then form the node's routing table. OSPF: ----- Open Shortest Path First (OSPF) is a link-state routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). OSPF is perhaps the most widely used interior gateway protocol (IGP) in large enterprise networks. IS-IS, another link-state dynamic routing protocol, is more common in large service provider networks. The most widely used exterior gateway protocol is the Border Gateway Protocol (BGP), the principal routing protocol between autonomous systems on the Internet. * Advantages of link state routing (as opposed to distance vector routing) include that link state routing converges rather quickly and * is not subject to the count-to-infinity problem; hence, no measures to combat this problem need to be taken. As the full network topology * is known to every node, rather advanced routing techniques can be implemented. * Disadvantages include that the link state information needs to be flooded through the network, causing higher overhead than link state protocols. * The memory and computational requirements are also higher. OSPF is an interior gateway protocol that routes Internet Protocol (IP) packets solely within a single routing domain (autonomous system). It gathers link state information from available routers and constructs a topology map of the network. The topology determines the routing table presented to the Internet Layer which makes routing decisions based solely on the destination IP address found in IP packets. OSPF was designed to support variable-length subnet masking (VLSM) or Classless Inter-Domain Routing (CIDR) addressing models.
karthik-kk / Link State Routing AlgorithmDijkstra's Algorithm
