In computer science, a graph means a network: a collectionof things (people, web pages, subway stations, animal species, . . .) wheresome pairs of those things are joined by some kind of pairwise relationship(spent more than 15 minutes inside an enclosed space with, has a [hyper]linkto, is the stop before/after on some subway line, is a predator of, . . .).It’s possible to make graphs sound hopelessly abstract and utterlyuninteresting—a graph is a pair〈V, E〉, where V is a nonemptycollection of entities called nodes and E is acollection of edges that join pairs ofnodes—but graphs are fascinating whenever the entities andthe relationship represented by the edges are themselves interesting!Here are just a few examples.
Review the options below to login to check your access.
Log in with your Cambridge Higher Education account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.