Check whether given degrees of vertices represent a Graph or Tree in Python

Suppose we have a list of degrees of some vertices. We have to check whether it is forming graph or tree.

So, if the input is like deg = [2,2,3,1,1,1], then the output will be Tree

To solve this, we will follow these steps −

• vert := number of vertices
• deg_sum := sum of all degree values of all vertices
• if 2*(vert-1) is same as deg_sum, then
  • return 'Tree'
• return 'Graph'

Let us see the following implementation to get better understanding −

Example Code

Live Demo

def solve(deg):
   vert = len(deg)
   deg_sum = sum(deg)
     
   if 2*(vert-1) == deg_sum:
      return 'Tree'
   return 'Graph'

deg = [2,2,3,1,1,1]
print(solve(deg))

Input

[2,2,3,1,1,1]

Output

Tree

Arnab Chakraborty

Published on 16-Jan-2021 04:28:56

• Related Questions & Answers
• Construct a graph from given degrees of all vertices in C++
• Check if a given graph is tree or not
• Sum of Degrees of Vertices Theorem
• Program to check whether given tree is symmetric tree or not in Python
• Program to check whether given graph is bipartite or not in Python
• Check if a given tree graph is linear or not in C++
• C++ Program to Check Whether a given Binary Tree is a Full Binary Tree or not
• C++ Program to Check Whether a Hamiltonian Cycle or Path Exists in a Given Graph
• Edges and Vertices of Graph
• Maximize the sum of products of the degrees between any two vertices of the tree in C++
• C++ Program to Check Whether a Given Tree is Binary Search Tree
• Program to check given graph is a set of trees or not in Python
• Check if a given array can represent Preorder Traversal of Binary Search Tree in C++
• Program to check whether a binary tree is complete or not in Python
• Program to check whether a binary tree is BST or not in Python