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

Please give the thumbs up, if it is helpful for you. Thank you!!

Answer 1)

finding a simple path of maximum length in a given graph.

the longest directed path in this graph is:

Start-> CPSC120-> CPSC121-> CPSC131-> CPSC254-> CPSC351-> CPSC471

Answer 2)
Indegree of vertex V is the number of edges which are
coming into the vertex V.

vertex has the highest in-degree:

the maximum indegree in the given graph is 2 and there are few veritces
whose indegree is 2.

i.e.
CPSC311
CPSC240
CPSC335
CPSC481
CPSC362

Answer3) Sum of the degrees of all the veritces:

Sum of indegree: 27

Sum of outdegree: 33

Total: 60

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

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