updated

True/False Network Flows SECTION 15.20 #5) Indicate whether the forme r oral where all are polis demand we un mumbers the the site animals toamnare en bens Circle the correct met TRUE FALSE must at the b) Intrattoirm there of wind Circle the correct ans TRUE FALSE e la topold ing Any dit weer (DAC) Clecle the more TRUE FALSE a di Antarlite graph with a total of duce can not have more than Cluele there answer: TRUE FALSE el c in shtrat path rules, if the violewe in the phrased tyor the shortest part in the Circle the correct answer: FALSE TRUE True False Network Flows SECTION 15.20 #5 Indicate whether the following statements are true or false. Given a feasible minimum cost network-flow problem where all capacities and supplies / demands are even numbers, then there exists an optimal solution where all arc flow amounts are even numbers. Circle the correct answer: TRUE FALSE (b) In a transportation problem, the number supply nodes must be equal to the number of demand nodes. Circle the correct answer: TRUE FALSE (c) Any directed acyclic graph (DAG) must have at least one topological ordering. Circle the correct answer: TRUE FALSE (a) Any bipartite graph with a total of 4 nodes can not have more than 4 arcs. Circle the correct answer: TRUE FALSE (e) In a shortest path problem, if the weight of each are in the graph is increased by one, the shortest path remains the same. Circle the correct answer: TRUE FALSE