Search⌘ K
AI Features

Introduction to Graphs

Explore fundamental graph theory concepts including vertices, edges, paths, and cycles. Learn two main graph representations and basic operations like adding and checking edges to efficiently model paired relationships and understand graph traversal algorithms.

Graphs overview

In this module, we study two representations of graphs and basic algorithms that use these representations.

Mathematically, a (directed) graph is a pair G=(V,E)G = (V ,E) where VV is a set of vertices and EE is a set of ordered pairs of vertices called edges. An edge (i,j)(i,j) is directed from ii to jj; ii is called the source of the edge and jj is called the target. A path in GG is a sequence of vertices v0,...,vkv_0,..., v_k ...