Given an undirected graph having N nodes, the task is to print the nodes having minimum and maximum degree.
Input: 1-----2 | | 3-----4 Output: Nodes with maximum degree : 1 2 3 4 Nodes with minimum degree : 1 2 3 4 Every node has a degree of 2. Input: 1 / \ 2 3 / 4 Output: Nodes with maximum degree : 1 2 Nodes with minimum degree : 3 4
Approach: For an undirected graph, the degree of a node is the number of edges incident to it, so the degree of each node can be calculated by counting its frequency in the list of edges. Hence the approach is to use a map to calculate the frequency of every vertex from the edge list and use the map to find the nodes having maximum and minimum degrees.
Below is the implementation of the above approach:
Nodes with maximum degree : 1 2 3 4 Nodes with minimum degree : 1 2 3 4
- Sum of degrees of all nodes of a undirected graph
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Detect cycle in the graph using degrees of nodes of graph
- Minimum adjacent swaps to move maximum and minimum to corners
- Print all neighbour nodes within distance K
- Print Leaf Nodes at a given Level
- Print the path between any two nodes of a tree | DFS
- Print all odd nodes of Binary Search Tree
- Print all internal nodes of a Binary tree
- Print all nodes between two given levels in Binary Tree
- Print all leaf nodes of a binary tree from right to left
- Print leaf nodes in binary tree from left to right using one stack
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Level with maximum number of nodes using DFS in a N-ary tree
- Find maximum among all right nodes in Binary Tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.