Why Graphs Exist and What Trees Cannot Model in DSA C - See It Work

Why Graphs Exist and What Trees Cannot Model

📖 Scenario: Imagine you are organizing a social network where people can be friends with many others, and friendships can go both ways. You want to represent these connections to find out who is connected to whom.Trees are like family trees where each person has only one parent, but social networks have many connections that trees cannot show well.

🎯 Goal: You will create a simple graph using an adjacency list to represent friendships between people. This will show why graphs are needed when trees cannot model multiple connections.

📋 What You'll Learn

Create an adjacency list to represent a graph of people and their friendships

Add a configuration variable for the number of people

Implement a function to add friendships (edges) between people

Print the adjacency list to show all connections

💡 Why This Matters

🌍 Real World

Social networks, transportation maps, and recommendation systems use graphs to model many-to-many relationships.

💼 Career

Understanding graphs is essential for software engineers working on network analysis, data science, and complex system modeling.

1

Create the adjacency list for the graph

Create an integer variable called num_people and set it to 4. Then create an array of integer pointers called adj_list with size num_people. Also create an integer array called adj_list_sizes with size num_people to track the number of friends each person has.

DSA C

int num_people = 4;
int* adj_list[4];
int adj_list_sizes[4];
// Your code here

Hint

Think of adj_list as a list where each person has a list of friends. adj_list_sizes keeps track of how many friends each person has.

2

Set the maximum number of friends per person

Create an integer variable called max_friends and set it to 3. This will be the maximum number of friends each person can have.

DSA C

int num_people = 4;
int* adj_list[4];
int adj_list_sizes[4] = {0, 0, 0, 0};
int max_friends = 3;
// Your code here

Hint

This variable helps us limit how many friends each person can have in the adjacency list.

3

Initialize adjacency lists and add friendships

For each person from 0 to num_people - 1, allocate memory for their friends list with size max_friends. Then add friendships by adding edges: person 0 is friends with 1 and 2, person 1 is friends with 2 and 3, and person 2 is friends with 3. Update adj_list_sizes accordingly.

DSA C

for (int i = 0; i < num_people; i++) {
    adj_list[i] = (int*)malloc(max_friends * sizeof(int));
}
// Add friendships below
// Your code here

Hint

Use a loop to allocate memory for each person's friends list. Then add friends by assigning values and increasing the size count.

4

Print the adjacency list to show friendships

Use a for loop with variable person from 0 to num_people - 1. Inside it, print Person person: then use another for loop with variable j from 0 to adj_list_sizes[person] - 1 to print each friend number separated by spaces. Print a newline after each person's friends.

DSA C

for (int person = 0; person < num_people; person++) {
    printf("Person %d: ", person);
    for (int j = 0; j < adj_list_sizes[person]; j++) {
        printf("%d ", adj_list[person][j]);
    }
    printf("\n");
}
// Your code here

Hint

Print each person and their friends using nested loops. Use spaces between friend numbers and a newline after each person.

Practice

1. Why do we need graphs when we already have trees in data structures?

easy

A. Because trees are faster to traverse than graphs.

B. Because graphs can represent connections between nodes in any pattern, including cycles and multiple links.

C. Because trees can only store numbers, not connections.

D. Because graphs use less memory than trees.

Solution

1. Step 1: Understand tree limitations

   Trees are hierarchical structures with no cycles and only one path between nodes.

2. Step 2: Understand graph capabilities

   Graphs can represent any connections including cycles, multiple edges, and complex relationships.

3. Final Answer:

   Because graphs can represent connections between nodes in any pattern, including cycles and multiple links. -> Option B

4. Quick Check:

   Graphs model complex connections, trees cannot [OK]

Hint: Graphs allow cycles and multiple links; trees do not [OK]

Common Mistakes:

• Thinking trees can have cycles
• Believing graphs use less memory always
• Confusing data storage with structure

2. Which of the following is the correct syntax to declare an adjacency list for a graph in C?

easy

A. int graph(5,5);

B. int graph[5][5];

C. int graph[] = {5};

D. int* graph[5];

Solution

1. Step 1: Understand adjacency list representation

   An adjacency list uses an array of pointers to lists (or arrays) of neighbors.

2. Step 2: Match syntax to adjacency list

   "int* graph[5];" declares an array of 5 pointers to int, suitable for adjacency lists.

3. Final Answer:

   int* graph[5]; -> Option D

4. Quick Check:

   Adjacency list uses array of pointers [OK]

Hint: Adjacency list uses array of pointers in C [OK]

Common Mistakes:

• Using 2D array for adjacency list (it's adjacency matrix)
• Incorrect array declaration syntax
• Confusing arrays with function calls

3. Consider the following C code snippet representing a graph adjacency matrix. What will be the output?

int graph[3][3] = {
  {0, 1, 0},
  {1, 0, 1},
  {0, 1, 0}
};

for(int i = 0; i < 3; i++) {
  for(int j = 0; j < 3; j++) {
    if(graph[i][j] == 1) {
      printf("%d -> %d\n", i, j);
    }
  }
}

medium

A. No output

B. 0 -> 1
1 -> 2
2 -> 0

C. 0 -> 1
1 -> 0
1 -> 2
2 -> 1

D. 0 -> 0
1 -> 1
2 -> 2

Solution

1. Step 1: Analyze adjacency matrix values

   Positions with 1 indicate edges: (0,1), (1,0), (1,2), (2,1).

2. Step 2: Trace nested loops printing edges

   Loops print edges where graph[i][j] == 1, so output lines are 0->1, 1->0, 1->2, 2->1.

3. Final Answer:

   0 -> 1 1 -> 0 1 -> 2 2 -> 1 -> Option C

4. Quick Check:

   Edges printed match adjacency matrix 1s [OK]

Hint: Print edges where adjacency matrix value is 1 [OK]

Common Mistakes:

• Ignoring symmetric edges
• Printing zeros as edges
• Confusing indices i and j

4. The following code attempts to create a graph with cycles using a tree structure. What is the main issue?

struct Node {
  int val;
  struct Node* left;
  struct Node* right;
};

// Trying to link nodes to form a cycle
node1->left = node2;
node2->left = node3;
node3->left = node1; // cycle created here

medium

A. Trees cannot have cycles, so this creates an invalid structure.

B. The pointers are not initialized properly causing segmentation fault.

C. The code will compile but not run because of missing return statements.

D. There is no issue; trees can have cycles.

Solution

1. Step 1: Understand tree structure rules

   Trees must not have cycles; each node has exactly one parent except root.

2. Step 2: Identify cycle creation in code

   Linking node3 back to node1 creates a cycle, violating tree properties.

3. Final Answer:

   Trees cannot have cycles, so this creates an invalid structure. -> Option A

4. Quick Check:

   Cycle in tree structure is invalid [OK]

Hint: Trees cannot contain cycles; cycles break tree rules [OK]

Common Mistakes:

• Thinking cycles are allowed in trees
• Confusing compile errors with logical errors
• Ignoring pointer initialization

5. You want to model a social network where users can be friends with multiple users, including mutual friendships and groups. Which data structure best models this, and why can't a tree be used here?

hard

A. Graph, because it supports cycles and multiple connections between nodes.

B. Tree, because it is simpler and faster for all connections.

C. Array, because it stores all users in order.

D. Linked list, because it can represent multiple friendships easily.

Solution

1. Step 1: Identify social network connection needs

   Users can have multiple friends, mutual connections, and cycles (friend loops).

2. Step 2: Match data structure capabilities

   Graphs support cycles and multiple edges; trees cannot have cycles or multiple parents.

3. Final Answer:

   Graph, because it supports cycles and multiple connections between nodes. -> Option A

4. Quick Check:

   Social networks need graphs, not trees [OK]

Hint: Use graphs for mutual and multiple connections [OK]

Common Mistakes:

• Choosing tree for cyclic relationships
• Confusing arrays or lists with graph structures
• Ignoring mutual friendship cycles