1. What is the longest directed path in this graph? 2. Which vertex has the high

Question

1. What is the longest directed path in this graph?

2. Which vertex has the highest in-degree?

3. What is the sum of the degrees of all vertices?

(Ignore dashed lines with arrows)

Corequisite Prerequisite Track Gateway CPsc: CPSC CPSC 311 351 Security CPSC CPSC Rev. 2017 03 20 Softw. Eng. Start CPSC 120 CPSC 121 CPSC 131 EPP CPSC 301 MATH 125 MATH MATH MATH MATH CPSC 240 Game Sci. Comp. CPSC CPSC MATH Int. & Ent. CPSC 335 CPSC 481 Pick 12 units & at least 1 lab PHYS PHYS PHYS PHYS 101L GEOL. GEOL. 101 101L GEOL GEOL 201 201L BIOL 120A MATH MATH BIOL 172

Explanation / Answer

Ans.

1.The longest directed path is from "start" to CPSC 481.

start->CPSC 120->CPSC 121->CPSC 131->EPP->CPSC 301->CPSC 335->CPSC 481

it took almost 6 edges to reach.

2.Vertex "CPSC 131" has highest degree of 7.i.e connected to 7 elements.

3.Ignoring the dashed line with arrows vertices,the total no.of sum of degrees of all vertices is 53.

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.