On Graph Algorithms - Deepstash

On Graph Algorithms

Breadth-first search is used to find the shortest path in an unweighted graph.

Dijkstra’s Algorithm is used to find the shortest path in a directed, acyclic graph (DAG).

The topological sort of a directed graph is the set of nodes ordered such that if u->v is an edge, then u comes before v in the sorting.

30

241 reads

CURATED FROM

IDEAS CURATED BY

The book covers algorithms at a basic level. I knew most of the stuff, so here are only so brief notes I took.

Similar ideas to On Graph Algorithms

There are Two Strategies for Learning Something

There are Two Strategies for Learning Something

  • Depth-first. This is where we pick one area and drill down.
  • Breadth-first works by first exploring your surroundings. If that doesn't work, pick one direction and fan out again.

If the area you're exploring is bounded...

Corin

Corin

Corin is part of a warrior clan but he himself has never been an active warrior. In fact, when his brother was about to be killed in a clan vs clan raid, Corin ran away. Later, he was banished from the village and had to live in a remote place with his best friend Agbeth. It was there that Corin ...

Python data processing with pandas

Pandas is a Python language package, which is used for data processing. This is a very common basic programming library when we use Python language for machine learning programming. This article is an introductory tutorial to it. Pandas provide fast, flexible and expressive data structures with t...

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.

Email

I agree to receive email updates