- Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Construct a graph from given degrees of all vertices in C++
Suppose we have a list of vertices, and their degrees are given. We have to generate one undirected graph from that degree sequence. It will not include loop or multiple edges. So if the degree sequence is like [2, 2, 1, 1], then the graph can be like
To solve this, we will follow these steps −
Define adjacency matrix adj to store the graph
for each vertex i, do
for each vertex j that is valid, and next to i
if the degree of vertex i and j are more than zero, then connect them
display the matrix.
Example
#include <iostream>
#include <iomanip>
using namespace std;
void generateGraph(int vert_degree[], int n) {
int adj_mat[n][n];
for(int i = 0; i<n; i++){
for(int j = 0; j < n; j++){
adj_mat[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (vert_degree[i] > 0 && vert_degree[j] > 0) {
vert_degree[i]--; vert_degree[j]--;
adj_mat[i][j] = adj_mat[j][i] = 1;
}
}
}
cout << endl << setw(3) << " ";
for (int i = 0; i < n; i++)
cout << setw(3) << "(" << i << ")";
cout << endl << endl;
for (int i = 0; i < n; i++) {
cout << setw(4) << "(" << i << ")";
for (int j = 0; j < n; j++)
cout << setw(5) << adj_mat[i][j];
cout << endl;
}
}
int main() {
int vert_degree[] = { 2, 2, 1, 1, 1 };
int n = sizeof(vert_degree) / sizeof(vert_degree[0]);
generateGraph(vert_degree, n);
}
Output
(0) (1) (2) (3) (4) (0) 0 1 1 0 0 (1) 1 0 0 1 0 (2) 1 0 0 0 0 (3) 0 1 0 0 0 (4) 0 0 0 0 0
Updated on 03-Jan-2020 11:21:57
- Related Questions & Answers
- Check whether given degrees of vertices represent a Graph or Tree in Python
- Sum of Degrees of Vertices Theorem
- Edges and Vertices of Graph
- Program to find out the sum of minimum cost within a graph among all vertices in Python
- Maximum and minimum isolated vertices in a graph in C++
- Maximize the sum of products of the degrees between any two vertices of the tree in C++
- C++ Program to find out the super vertices in a graph
- Area of a polygon with given n ordered vertices in C++
- Construct a Binary Search Tree from given postorder in Python
- Finding the simple non-isomorphic graphs with n vertices in a graph
- Construct a BST from given postorder traversal using Stack in Python
- How can we measure the similarity or distance between two vertices in a graph?
- Construct an array from GCDs of consecutive elements in given array in C++
- Construct BST from given preorder traversal - Set 1 in C++
- Construct BST from given preorder traversal - Set 2 in C++
Advertisements