Minimum Spanning Tree (MST) Given an undirected weighted graph G = (V, E) Want to find a subset of E with the minimum total weight that connects all the nodes into a tree We will cover …

Describe an algorithm to determine, given an undirected graph G as input, whether it is possible to direct each edge of G so that the resulting directed graph is strongly connected.

Techniques for searching a graph lie at the heart of the field of graph algorithms. Section 22.1 discusses the two most common computational representations of graphs: as adjacency lists …

sparse matrix algorithms can be usefully viewed as graph algorithms Some graph algorithms can be interpreted as matrix algorithms but it may or may not be useful to do this may be useful if …

This is the first of several lectures on graph algorithms. We will see how simple algorithms like depth-first-search can be used in clever ways (for a problem known as topological sorting) and …

In this chapter, we focus on a few basic problems and algorithms dealing with graphs.

g over all vertices in the graph, and discovering all of them. It seems both algorithms have two versions: the first version having a source and discovering only those vertices reachable from …