CS 684
Graph Algorithms. 3 credits
George Mason University · UGRD · Fall 2026
1 section
Catalog description
Data structures and analytical techniques to study graph algorithms. Data structures include disjoint sets, heaps, and dynamic trees. Algorithms include minimum spanning trees, shortest path, maximum flow, and graph planarity. Offered by Computer Science . May not be repeated for credit.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #george_mason-2241Fall 2026UGRD
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?