directed graphs have two different notions describing how "connected" they are:strong connectednessandweak connectedness.

1. Why there are two different notions of connectedness in a directed graph.
2. Thinking of the entire world's map as a directed graph, the entire world's map as a directed graph. Which of the following is expected to find and why.

• The entire graph would be strongly connected.
• The entire graph would be weakly connected.
• The entire graph would not be connected, but it would contain a small number of large strongly connected components.
• The entire graph would not be connected, but it would contain a small number of large weakly connected components.
• The entire graph would not be connected, and can't find large connected components of any kind.