This is a Java Program to Implement Graph Coloring Algorithm. Graph Coloring is a way of coloring the vertices of a undirected graph such that no two adjacent vertices share the same color.
Here is the source code of the Java Program to Implement Graph Coloring Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** ** Java Program to Implement Graph Coloring Algorithm **/ import java.util.Scanner; /** Class GraphColoring **/ public class GraphColoring { private int V, numOfColors; private int[] color; private int[][] graph; /** Function to assign color **/ public void graphColor(int[][] g, int noc) { V = g.length; numOfColors = noc; color = new int[V]; graph = g; try { solve(0); System.out.println("No solution"); } catch (Exception e) { System.out.println("\nSolution exists "); display(); } } /** function to assign colors recursively **/ public void solve(int v) throws Exception { /** base case - solution found **/ if (v == V) throw new Exception("Solution found"); /** try all colours **/ for (int c = 1; c <= numOfColors; c++) { if (isPossible(v, c)) { /** assign and proceed with next vertex **/ color[v] = c; solve(v + 1); /** wrong assignement **/ color[v] = 0; } } } /** function to check if it is valid to allot that color to vertex **/ public boolean isPossible(int v, int c) { for (int i = 0; i < V; i++) if (graph[v][i] == 1 && c == color[i]) return false; return true; } /** display solution **/ public void display() { System.out.print("\nColors : "); for (int i = 0; i < V; i++) System.out.print(color[i] +" "); System.out.println(); } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Graph Coloring Algorithm Test\n"); /** Make an object of GraphColoring class **/ GraphColoring gc = new GraphColoring(); /** Accept number of vertices **/ System.out.println("Enter number of verticesz\n"); int V = scan.nextInt(); /** get graph **/ System.out.println("\nEnter matrix\n"); int[][] graph = new int[V][V]; for (int i = 0; i < V; i++) for (int j = 0; j < V; j++) graph[i][j] = scan.nextInt(); System.out.println("\nEnter number of colors"); int c = scan.nextInt(); gc.graphColor(graph, c); } }
Graph Coloring Algorithm Test Enter number of vertices 10 Enter matrix 0 1 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0 0 1 1 0 0 1 0 0 1 0 0 0 1 0 0 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 1 0 0 Enter number of colors 3 Solution exists Colors : 1 2 1 2 3 2 1 3 3 2
Related posts:
Template Engines for Spring
Java Program to Find the Nearest Neighbor Using K-D Tree Search
JUnit 5 @Test Annotation
Java Program to Check whether Graph is a Bipartite using BFS
Spring Boot - OAuth2 with JWT
Comparing Strings in Java
Vector trong Java
@Before vs @BeforeClass vs @BeforeEach vs @BeforeAll
Java Program to Implement Circular Singly Linked List
So sánh HashSet, LinkedHashSet và TreeSet trong Java
New Stream Collectors in Java 9
Multi Dimensional ArrayList in Java
Java Program to Implement HashTable API
Java Program to Implement Heap Sort Using Library Functions
Lập trình đa luồng với CompletableFuture trong Java 8
How to Round a Number to N Decimal Places in Java
Guava Collections Cookbook
Servlet 3 Async Support with Spring MVC and Spring Security
Java 8 Stream findFirst() vs. findAny()
Circular Dependencies in Spring
Java Program to Implement Direct Addressing Tables
Converting Between Byte Arrays and Hexadecimal Strings in Java
Converting Iterator to List
Comparing getPath(), getAbsolutePath(), and getCanonicalPath() in Java
Java Program to Use rand and srand Functions
Java Program to Find Number of Articulation points in a Graph
Spring Boot - Google OAuth2 Sign-In
Instance Profile Credentials using Spring Cloud
Java Program to Perform Optimal Paranthesization Using Dynamic Programming
Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence
REST Web service: Upload và Download file với Jersey 2.x
An Intro to Spring Cloud Zookeeper