Understand and apply vertex-edge graph topics.
Resources cannot be aligned to this standard, browse sub-standards to find lessons.
Extend work with adjacency matrices for graphs, such as interpreting row sums and using the 𝑛ᵗʰ power of the adjacency matrix to count paths of length 𝑛 in a graph.
Study the following topics related to vertex-edge graph: Euler circuits, Hamilton circuits, shortest path, vertex coloring, and adjacency matrices.
Understand, analyze, and apply vertex-edge graphs to model and solve problems related to paths, circuits, networks, and relationships among a finite number of elements, in real-world and abstract settings.
Devise, analyze, and apply algorithms for solving vertex-edge graph problems.