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

Course: Computer science theory > Unit 1

Lesson 10: Graph representation
Computing
Computer science theory
Algorithms
Graph representation
© 2024 Khan AcademyTerms of usePrivacy PolicyCookie Notice

Representing graphs

Google Classroom

Problem

Given the following directed graph, how would you represent it with an edge list?
A directed graph with edges from 1 to 3, 3 to 4, 3 to 5, 5 to 6, 4 to 6, and 2 to 4
List the edges in the table below. The order of the edges doesn't matter, but the order of the vertices in each edge does matter, since this graph is directed.
u
v