liveBook · Manning

Connected graph

As explained in Classic Computer Science Problems in Swift: Essential techniques for practicing programmers

A connected graph is a graph in which a path exists between every pair of vertices.

A connected graph provides a path from every vertex to every other vertex. Connectivity is the condition that lets a spanning tree reach all vertices; without it, a minimum spanning tree covers only the starting vertex’s connected component. section 4.3

City network

The weighted graph of 15 major metropolitan areas models cities as vertices and distances as edge weights. Its minimum spanning tree connects every city, using 14 selected edges with total weight 5372.

How Classic Computer Science Problems in Swift: Essential techniques for practicing programmers covers it

How deep it goes
Defines connectivity and relates it to spanning trees, but defers a standalone connectivity algorithm.
Examples
Illustrates connectivity through a weighted metropolitan-area network and its minimum spanning tree.
What it assumes
Assumes familiarity with vertices, edges, paths, and graphs while defining connectivity, trees, cycles, and spanning trees.
What you can do after
Evaluate whether a graph can support a spanning tree covering every vertex.
How it connects
Connects connected graphs with vertices, edges, paths, trees, cycles, spanning trees, and minimum spanning trees.

Also explained in

Compare how 2 books explain connected graph →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Classic Computer Science Problems in Swift: Essential techniques for practicing programmers. The section links point to the parts of the book it draws on.