How to Find Maximum and Minimum degree nodes of a Weighted Undirected Graph using Adjacency Matrix Representation

rishabhgarg25699 / Competitive-Programming

This repository contains some useful codes, techniques, algorithms and problem solutions helpful in Competitive Coding. Join with me on telegram group https://t.me/joinchat/GL4Y8RREZbz-Cp78R869CQ

63 stars 120 forks source link

How to Find Maximum and Minimum degree nodes of a Weighted Undirected Graph using Adjacency Matrix Representation #269

Closed nishitanand closed 4 years ago

nishitanand commented 4 years ago

We will take input a graph and save it in the form of an Adjacency Matrix in C++ and then find the nodes with minimum and maximum degrees

Please assign this issue to me