ebouhid's Graph Algorithms Questions

A Flamengo fan living in Campinas made a promise that if their team reached the final of the 2025 Copa Libertadores championship, they would visit all the stadiums where Flamengo played during the knockout stages. Now that Flamengo has indeed made it to the final against Palmeiras, the fan must fulfill this promise before returning home to Campinas to catch a flight to Lima for the final. To plan the most efficient route, the fan created a simplified map in the form of a graph, where each node represents a stadium and each edge is weighted by the distance between stadiums. Using the Cheapest Insertion heuristic, they determined their optimal itinerary. What was the total distance covered on this journey? A) 4085 Km B) 4135 Km C) 4140 Km D) 5815 Km E) None of the above Original idea by: Eduardo Bouhid

Consider the following example of a standard fully-connected Multilayer Perceptron (MLP), a type of artificial neural network. It has an input layer, a single hidden layer, and an output layer. In this architecture, neurons in one layer are connected to all neurons in the immediately following layer, but there are no connections within a layer or connections that skip layers. Here, the input and output layers have 5 neurons each, while the hidden layer has 10 neurons. Based on this description, would you expect the correlation exponent,  μ, to be: a) µ > 0 b) µ < 0 c) µ = 0 d) µ > 1 e) None of the above Original idea by: Eduardo Bouhid