Question: COSC2430: Programming and Data Structures Graph based clustering Introduction In this homework, you will create a C++ program that receives in input a weighted graph



COSC2430: Programming and Data Structures Graph based clustering 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 1 2 3 4 023 013 012 03452 3 0 24-999 4201-999 5 410-999 2-999 -999 -999 0 -999 represents infinite distance (no connection between two nodes). This input corresponds to the following weighted, undirected graph 4 2 4 1 COSC2430: Programming and Data Structures Graph based clustering 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 1 2 3 4 023 013 012 03452 3 0 24-999 4201-999 5 410-999 2-999 -999 -999 0 -999 represents infinite distance (no connection between two nodes). This input corresponds to the following weighted, undirected graph 4 2 4 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
