Dijkstra’s algorithm
Dijkstra’s algorithm can be used to determine the shortest path from one node in a graph to every other node within the same graph data structure, provided that the nodes are reachable from the starting node.
3
7 reads
CURATED FROM
IDEAS CURATED BY
The idea is part of this collection:
Learn more about computerscience with this collection
Understanding machine learning models
Improving data analysis and decision-making
How Google uses logic in machine learning
Related collections
Similar ideas to Dijkstra’s algorithm
You heard about Load-Balancers, Docker Swarm does it Better
Just like a manager of a shipping company has to pick which ship is best used for caring a container, a Manager node ensures that container workloads are assigned to run on the most appropriate Worker node for optimal efficienc...
Divergence and emergence
- Networked thinking is based on two key principles: divergence and emergence.
- Starting from any relevant node in the network, the divergent phase consists in branching out from that original point in many directions, without trying to evaluate the validity of any particular idea.
What is an index?
A database index is a data structure that improves the speed of data retrieval operations on a database table at the cost of additional writes and storage space to maintain the index data structure. Indexes are used to quickly locate data without having to search every row in a database table eve...
Read & Learn
20x Faster
without
deepstash
with
deepstash
with
deepstash
Personalized microlearning
—
100+ Learning Journeys
—
Access to 200,000+ ideas
—
Access to the mobile app
—
Unlimited idea saving
—
—
Unlimited history
—
—
Unlimited listening to ideas
—
—
Downloading & offline access
—
—
Supercharge your mind with one idea per day
Enter your email and spend 1 minute every day to learn something new.
I agree to receive email updates