Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
84 views2 pages

Greedy Coloring Algorithm (Recap)

The document explains a graph coloring code that uses backtracking to assign colors to vertices of a graph such that no two adjacent vertices share the same color, using a maximum of `m` colors. It details the variables used, the recursive function `graphColour(int k)` for coloring the vertices, and the `isSafe(int k, int c)` function to check if a color can be safely assigned. An example of coloring a triangle graph is provided to illustrate the process.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
84 views2 pages

Greedy Coloring Algorithm (Recap)

The document explains a graph coloring code that uses backtracking to assign colors to vertices of a graph such that no two adjacent vertices share the same color, using a maximum of `m` colors. It details the variables used, the recursive function `graphColour(int k)` for coloring the vertices, and the `isSafe(int k, int c)` function to check if a color can be safely assigned. An example of coloring a triangle graph is provided to illustrate the process.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Sure!

Here's a clear and simple explanation of your **graph coloring code** using
**backtracking**:

---

### 🔷 **Purpose of the Code:**


To color the **vertices of a graph** such that:
- No two **adjacent vertices** have the **same color**.
- Use at most **`m` colors**.
This is a classic **backtracking problem**.

---

### 🔷 **Variables Used:**


- `G[k][i]`: The **adjacency matrix** of the graph. If `G[k][i] == 1`, then vertex
`k` is connected to vertex `i`.
- `x[k]`: The **color assigned** to vertex `k`.
- `m`: The **maximum number of colors** allowed.
- `n`: Total number of vertices in the graph.

---

### ✅ **Function: `graphColour(int k)`**


This is a **recursive function** to try assigning colors to vertices one by one.

#### 🔹 Step-by-step:
1. Loop through each color `c` from 1 to `m`.
2. Check if it is **safe to assign color `c` to vertex `k`** using `isSafe()`.
3. If safe:
- Assign color `c` to vertex `k`: `x[k] = c`.
- If more vertices remain (`k + 1 < n`), **recurse** to color the next vertex:
`graphColour(k + 1)`.
- If all vertices are colored (`k+1 == n`), **print the solution**.
4. If no color is safe, it **backtracks** and tries a different color.

---

### ✅ **Function: `isSafe(int k, int c)`**


This checks whether **color `c` can be safely assigned** to vertex `k`.

#### 🔹 How:
- For each other vertex `i`, if:
- Vertex `i` is **adjacent** to `k` (`G[k][i] == 1`)
- AND `i` already has the same color `c` (`x[i] == c`)
→ Then it's **not safe**, return `false`.

If no adjacent vertex has the same color → return `true`.

---

### ✅ **Example:**
If you try to color a triangle graph (3 nodes all connected), this function will:
- Try different colors for each node.
- Reject any assignment where two connected nodes have the same color.
- Eventually find and print a valid coloring.

---

Let me know if you'd like to see this explained with a diagram or implemented in a
specific language (like Python or C++)!

You might also like