If you're seeing this message, it means we're having trouble loading external resources on our website.

If you're behind a web filter, please make sure that the domains *.kastatic.org and *.kasandbox.org are unblocked.

Main content

STANDARDS

 > 

US-NC

Math

North Carolina Math

Discrete Mathematics for Computer Science: Graph Theory

DCS.GT.1

Understand graph theory to model relationships and solve problems.

DCS.GT.1.1

Not covered
Represent real world situations with a vertex-edge graph, adjacency matrix, and vertex-edge table.
(Content unavailable)

DCS.GT.1.2

Not covered
Test graphs and digraphs for Euler paths, Euler circuits, Hamiltonian paths, or Hamiltonian circuits.
(Content unavailable)

DCS.GT.1.3

Not covered
Interpret a complete digraph to determine rank.
(Content unavailable)

DCS.GT.2

Apply graph theory to solve problems.

DCS.GT.2.1

Not covered
Implement critical path analysis algorithms to determine the minimum project time.
(Content unavailable)

DCS.GT.2.2

Not covered
Implement the brute force method, the nearest-neighbor algorithm, and the cheapest-link algorithm to find solutions to a Traveling Salesperson Problem.
(Content unavailable)

DCS.GT.2.3

Not covered
Implement vertex-coloring techniques to solve problems.
(Content unavailable)

DCS.GT.2.4

Not covered
Implement Kruskal and Prim’s algorithms to determine the weight of the minimum spanning tree of a connected graph.
(Content unavailable)