Question: Introduction In this homework, you will create a C++ program that receives in input a weighted graph and groups its nodes in the required number



Introduction In this homework, you will create a C++ program that receives in input a weighted graph and groups its nodes in the required number of clusters. Input and Output The input is a single text file containing: The graph, in adjacent list format The weight matrix The required number of clusters Example 1 of input 1234 02 3 013 012 0 3 452 3 0 24-999 4 201-999 5 4 10-999 2-999-999-999 0 -999 represents infinite distance (no connection between two nodes). This input corresponds to the following weighted, undirected graph 2 4 2
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
