Combinatorial Optimization and Graph Algorithms

CT Score

1500

#0 of 0 in ENG SE

Difficulty

—/10

Workload

—h/wk

Median grade

—

from grade distribution

Would take again

—

n = 0 verified

Grade distribution

No distribution published for this course.

By professor: same course, different game

PROFESSORSCOREGRADEHRS/WKTERMS

Professor ratings →

Sections

No section data for this term yet.

In the tree

(ENGME411 OR CASCS330) or equivalent course on optimization or algorithms. - Design data structures and efficient algorithms for priority queues, minimum spanning trees, searching in graphs, strongly connected components, shortest paths, maximum matching, and maximum network flow. Some discussion of intractable problems and distributed network algorithms. Same as ENG EC 732, ENG ME 732. Students may not receive credits for both→ENG SE 732→unlocks 0 courses

No mapped courses require this one yet. See on the map →

Study groups

0 active

🔒 Verified-only writes. You post as “sophomore, lecture section”: real enough to trust, anonymous enough to be honest.