Why Graph Terminology Vertices Edges Directed Undirected Weighted in DSA Java?

The Big Idea

Discover how graphs turn messy connections into clear maps you can explore and understand!

The Scenario

Imagine you want to map out all your friends and how they are connected. You try to write down each friend and every connection by hand on paper.

As the number of friends grows, it becomes a tangled mess that's hard to understand or update.

The Problem

Writing connections manually is slow and confusing.

You might forget some links or mix up directions (who knows who).

It's hard to see the big picture or answer questions like "Who is connected to whom?" or "Is there a path from me to a friend?"

The Solution

Graphs organize connections clearly using vertices (points) and edges (lines).

Directed edges show one-way connections, undirected edges show two-way.

Weighted edges add numbers to show strength or cost of connections.

This structure makes it easy to explore and analyze relationships.

Before vs After

✗ Before

String[] friends = {"Alice", "Bob", "Carol"};
// Manually track connections with notes or lists
// No clear structure for direction or weights

✓ After

class Graph {
  Map<String, List<Edge>> adjacencyList;
  // Vertices are keys, edges show connections with direction and weights
}

What It Enables

Graphs let you model and solve complex connection problems like social networks, maps, and recommendation systems easily.

Real Life Example

Social media platforms use graphs to show who follows whom (directed), friends (undirected), and how strong connections are (weighted).

Key Takeaways

Vertices represent entities like people or places.

Edges represent connections, which can be one-way (directed) or two-way (undirected).

Weights add extra information like distance or strength to connections.

Practice

1. Which of the following best describes a vertex in a graph?

easy

A. A point or node where edges meet

B. A line connecting two vertices

C. A graph with no edges

D. A graph that has weights on edges

Solution

1. Step 1: Understand the definition of vertex

   A vertex is a fundamental unit in a graph representing a point or node.

2. Step 2: Differentiate vertex from edges and graph types

   Edges connect vertices; weights and graph types describe edges or the whole graph, not vertices.

3. Final Answer:

   A point or node where edges meet -> Option A

4. Quick Check:

   Vertex = point/node [OK]

Hint: Vertices are points/nodes, edges are connections [OK]

Common Mistakes:

• Confusing edges with vertices
• Thinking weights define vertices
• Mixing graph types with vertex definition

2. Which of the following is the correct way to declare an undirected weighted graph using adjacency list in Java?

easy

A. Map graph = new HashMap<>();

B. Map graph = new TreeMap<>();

C. Map>> graph = new TreeSet<>();

D. Map>> graph = new HashMap<>();

Solution

1. Step 1: Identify data structure for weighted edges

   Weighted edges need to store both neighbor and weight, so Pair is used.

2. Step 2: Choose correct map and list types

   HashMap with List of pairs is standard for adjacency list of weighted graphs.

3. Final Answer:

   Map>> graph = new HashMap<>(); -> Option D

4. Quick Check:

   Weighted graph uses Pair for edges [OK]

Hint: Weighted edges need pairs: neighbor and weight [OK]

Common Mistakes:

• Using List<Integer> for weighted edges
• Using TreeSet instead of List for adjacency
• Confusing Map types for graph

3. Consider the following Java code snippet for a directed graph:

Map graph = new HashMap<>();
graph.put(1, Arrays.asList(2, 3));
graph.put(2, Arrays.asList(3));
graph.put(3, Arrays.asList());
System.out.println(graph.get(1));

What will be the output?

medium

A. null

B. [1, 2, 3]

C. [2, 3]

D. []

Solution

1. Step 1: Check what is stored for key 1

   Key 1 maps to list containing 2 and 3.

2. Step 2: Print the list for key 1

   Printing graph.get(1) outputs the list [2, 3].

3. Final Answer:

   [2, 3] -> Option C

4. Quick Check:

   graph.get(1) = [2, 3] [OK]

Hint: Print adjacency list for key to see neighbors [OK]

Common Mistakes:

• Expecting all vertices in output
• Confusing keys and values
• Assuming empty list prints null

4. The following code attempts to add an edge to an undirected graph represented by adjacency list. What is the bug?

void addEdge(Map graph, int u, int v) {
    graph.get(u).add(v);
}

medium

A. It adds edge only from u to v, missing v to u

B. It uses get() instead of put() to add edge

C. It should use a Set instead of List for adjacency

D. It should clear the adjacency list before adding

Solution

1. Step 1: Understand undirected graph edge addition

   Undirected edges must be added both ways: u to v and v to u.

2. Step 2: Analyze given code

   Code adds edge only from u to v, missing the reverse edge.

3. Final Answer:

   It adds edge only from u to v, missing v to u -> Option A

4. Quick Check:

   Undirected edges need both directions [OK]

Hint: Undirected edges require adding both directions [OK]

Common Mistakes:

• Adding edge only one way in undirected graph
• Confusing get() and put() usage
• Clearing adjacency list mistakenly

5. You have a weighted directed graph represented as:

Map>> graph = new HashMap<>();
graph.put(1, Arrays.asList(new Pair<>(2, 5), new Pair<>(3, 10)));
graph.put(2, Arrays.asList(new Pair<>(3, 2)));
graph.put(3, Arrays.asList());

How would you find the total weight of edges going out from vertex 1?

hard

A. Sum weights 10 + 2 = 12

B. Sum weights 5 + 10 = 15

C. Sum weights 5 + 2 = 7

D. Count edges: 2

Solution

1. Step 1: Identify edges from vertex 1

   Edges from 1 go to 2 with weight 5, and to 3 with weight 10.

2. Step 2: Sum the weights of these edges

   Total weight = 5 + 10 = 15.

3. Final Answer:

   Sum weights 5 + 10 = 15 -> Option B

4. Quick Check:

   Total outgoing weight from 1 = 15 [OK]

Hint: Add weights of all edges from the vertex [OK]

Common Mistakes:

• Adding weights from wrong vertices
• Counting edges instead of summing weights
• Mixing weights of different edges