Problem 1 (30 points) In a network (e.g., social network) betweenness centrality of a vertex is the total number of shortest paths from all vertices to all others that pass through that vertex. In a...

Problem 1 (30 points)

In a network (e.g., social network) betweenness centrality of a vertex is the total number of shortest paths from all vertices to all others that pass through that vertex. In a transportation network, betweenness centrality is used to analyze various activities. For example, betweenness centrality in a road network of a city can be used to determine intersections where traffic congestions are likely to happen.

Design and implement an algorithm to find the top 20 betweenness centrality vertices (intersections) in the road network at:Project 4_Problem 1_InputData.csv

download.

Problem 2 (30 points)

Design and implement two algorithms, dynamic programming and branch-and-bound, for the Traveling Salesperson Problem byusing two data structures for the adjacency matrix:

1. A two-dimensional array.


2. A one-dimensional array for storing only the elements of the lower triangle in the adjacency matrix.

Your algorithm must take the input data (network) at:Project 4_Problem 2_InputData.csv.

download

Problem 3 (40 points)

Exercise 40, Additional Exercises, Chapter 5, Page 248

Your program must print the number of legal queen configurations for n = 2, 3, 4, and 5. Include the number of legal queen configurations for each required value of n in your pdf report.

Here

downloadis a guide for all potential attacking patterns

I have already sent it a file that has all the details