Find Closeness Write a program that input the vertices and edges (with weights) of a graph. Please
Fantastic news! We've Found the answer you've been seeking!
Question:
Write a program that input the vertices and edges (with weights) of a graph. Please let the input be variable, that is enter the number of vertices and edges, as well as the weights of the edges, Initially enter the weigths of the edges into a nXn matrix (please label the vertices from 0 to n-1). Apply Floyd-Warshall agorithm and find the all terminal shortest distances. From this matrix find the vertice (vertices) with largest closeness.As an input example try the directed graph discussed in class. Moreover make sure the input is not hard-coded but as a flexible input.
Related Book For
Introduction to Java Programming, Comprehensive Version
ISBN: 978-0133761313
10th Edition
Authors: Y. Daniel Liang
Posted Date: