This is a java program to check graph construction is possible or not using given degree sequence. If the sum of degree is even graph construction is possible, not otherwise.
Here is the source code of the Java Program to Check if any Graph is Possible to be Constructed for a Given Degree Sequence. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
package com.sanfoundry.combinatorial; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class CheckGraphConstuction { public static Integer sum(List<Integer> list) { Integer sum = 0; for (Integer integer : list) { sum += integer; } return sum; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter the number of vertices: "); Integer n = sc.nextInt(); System.out .println("Enter the Degree Sequence: <Degree sequence is always in non-increasing order>"); List<Integer> sequence = new ArrayList<Integer>(); while (n > 0) { sequence.add(sc.nextInt()); n--; } System.out.println(sequence.toString()); if (sum(sequence) % 2 == 0) { System.out .println("Graph can be constructed using the given sequence G=(" + sequence.size() + ", " + (sum(sequence) / 2) + ")."); } sc.close(); } }
Output:
$ javac CheckGraphConstuction.java $ java CheckGraphConstuction Enter the number of vertices: 7 Enter the Degree Sequence: <Degree sequence is always in non-increasing order> 5 3 3 2 2 1 0 [5, 3, 3, 2, 2, 1, 0] Graph can be constructed using the given sequence G=(7, 8). Enter the number of vertices: 3 Enter the Degree Sequence: <Degree sequence is always in non-increasing order> 3 3 1 [3, 3, 1] no soultion exists.
Related posts:
Java Program to Implement Weight Balanced Tree
Guide to Java Instrumentation
Java Program to Generate Random Hexadecimal Byte
Guide to Java OutputStream
Count Occurrences of a Char in a String
JUnit 5 @Test Annotation
Giới thiệu Aspect Oriented Programming (AOP)
Hướng dẫn Java Design Pattern – Template Method
Overview of Spring Boot Dev Tools
A Guide to Java HashMap
Java Program to Implement Leftist Heap
Java Web Services – Jersey JAX-RS – REST và sử dụng REST API testing tools với Postman
Java Map With Case-Insensitive Keys
Custom Error Pages with Spring MVC
Spring Boot Annotations
Java Program to Construct an Expression Tree for an Postfix Expression
HttpClient 4 – Follow Redirects for POST
Lớp TreeMap trong Java
Java Program to Implement Sorted Array
Java Program to Implement Traveling Salesman Problem using Nearest neighbour Algorithm
Java Program to Perform Naive String Matching
Java Program to Implement LinkedHashMap API
Remove HTML tags from a file to extract only the TEXT
Getting Started with Forms in Spring MVC
Java Program to Check if a Directed Graph is a Tree or Not Using DFS
Java Program to Implement Trie
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
Java Program to Implement Ternary Search Tree
Rest Web service: Filter và Interceptor với Jersey 2.x (P1)
A Quick Guide to Spring MVC Matrix Variables
Annotation trong Java 8
An Intro to Spring Cloud Vault