Am I right about the differences between Floyd-Warshall, Dijkstra’s and Bellman-Ford algorithms?

I’ve been studying the three and I’m stating my inferences from them below. Could someone tell me if I have understood them accurately enough or not? Thank you.

What are graphs in laymen’s terms

What are graphs, in computer science, and what are they used for? In laymen’s terms preferably.

When to use DAG (Directed Acyclic Graph) in programming?

I recently found a framework named ecto.

Tree vs Graphs in search

When you use graphs vs when to use trees for data structures?

Chambers In A Castle Algorithm

Problem Statement –

Cyclomatic complexity with two IFs – why it is 3?

I have read an article with following example:

Implementing a sort of navigation system

So I am undertaking a project which does navigation sort of thing. So here is how the problem statement looks like.

spotting graph cycles – simple explanation

could some please help me understand how to find cycles in graphs in laymans terms?

Finding subtree in a tree

I have a tree:

Visiting points on a number line while minimizing a cost not related to distance

I need some help on this ACM ICPC problem. My current idea is to model this as a shortest path problem, which is described under the problem statement.