Algorithms - Graphs

Undirected Graphs

Some problems

• Path
• Shortest path
• Cycle
• Ehler tour: A cycle that uses each edge excatly once.
• Hamilton tour: A cycle that uses each vertex exactly once
• classical NP-complete problem.
• Connectivity
• MST:
• Biconnectivity: A vertex whose removal disconnects the graph
• Planarity
• Graph isomorphism: Are two graphs identical?
• No one knows so far. A lonstanding open problem

Representations

Real-world graphs tend to be sparse (huge number of vertices, small average vertex degree).

• Set-of-edges representation
• unefficient
• space cost is prohibitive
• GOOD

• Space usage proportional to V + E
• Constant time to add an edge
• Time proportional to the degree of v to iterate through vertices adjacent to v

Depth-first Search (DFS)

Typical applications:

• Find all vertices connected to a given source vertex
• Find a path between two vertices

Algorithm:

• Use recursion (a function-call stack) or an explicit stack.
• Mark each visited vertex (and keep track of edge taken to visit it)
• Return (retrace steps) when no unvisited options
1public class DepthFirstPaths{
2    private blloean[] marked;
3    private int[] edgeTO;
4    private int s;
5    public DepthFirstPaths(Graph G, int s)
6    {
7        // ...
8        dfs(G, s);
9    }
10
11    private void dfs(Graph Gm int v)
12    {
13        marked[v] = true;
14        for (int w : G.adj(v))
15            if (!marked[v])
16            {
17                dfs(G, w)
18                edgeTo[w] = v;
19            }
20    }
21}

Propositions:

1. DFS marks all vertices connected to s in time proportional to the sum of their degrees.
2. After DFS, can find vertices connected to s in constant time and can find a path to s in time proportional to its length.

Typical applications:

• shortest path

Algorithm:

• Put s onto a queue, and mark s as visited
• Take the next vertex v from the queue and mark it
• Put onto the queue all unmarked vertices that are adjacent to v
2{
3    private boolean[] marked;
4    private int[] edgeTo;
5    // ...
6    private void bfs(Graph G, int s)
7    {
8        Queue<Integer> q = new Queue<>();
9        q.enqueue(s);
10        marked[s] = ture;
11        while (!q.isEmpty())
12        {
13            int v = q.dequeue();
15            {
16                if (!marked[w])
17                {
18                    q.enqueue(w);
19                    marked[w] = true;
20                    edgeTo[w] = v;
21                }
22            }
23        }
24    }
25}

Proposition:

1. BFS computes shortest paths (fewest number of edges) from s to all other vertices in a graph in time proportional to E + V

Applications of DFS

Connected components

The goal is to preprocess graph to answer queries of the form is v connected to w? in constant time.

The relation is connected to is an equivalence relation:

• Reflexive: v is connected to v
• Symmetric: if v is connected to w, then w is connected to v
• Transitive: if v connected to w and w connected to x, then v connected to x
1public class CC {
2    private boolean[] marked;
3    private int[] id;
4    private int count;
5
6    public CC(Graph G) {
7        marked = new boolean[G.V()];
8        id = new int[G.V()];
9        for (int v = 0, v < G.V(); v++) {
10            if (!marked[v]) {
11                dfs(G, v);
12                count++;
13            }
14        }
15    }
16
17    // ...
18
19    private void dfs(Graph G, int v) {
20        marked[v] = true;
21        id[v] = count;
22        for (int w : G.adj(v)) {
23            if (!marked[w]) {
24                dfs(G, w)
25            }
26        }
27    }
28}

Cycle detection

Problem: Is a given graph acylic?

TODO

Two-colorability

Problem: Is the graph bipartite?

TODO

TODO

TODO

Directed Graphs

A directed graph (or digraph) is a set of vertices and a collection of directed edges. Each directed edge connects an ordered pair of vertices.

• outdegree: the number of edges going from it
• indegree: the number fo edges going into it
• directed path: a sequence of vertices in which there is a (directed) edge pointing from each vertex in the sequence to its successor in the sequence
• directed cycle
• simple cycle: a cycle with no repeated edges or vertices

Representations

• Based on iterating over vertices pointing from v
• Real-world digraphs tend to be sparse
1public class Digraph {
2    private final int V;
4
5    public Digraph(int V) {
6        this.V = V;
7        adj = (Bag<Integer>[]) new Bag[V];
8        for (int v = 0; v < V; v++) {
10        }
11    }
12
13    public void addEdge(int v, int w) {
15    }
16
17    public Iterable<Integer> adj(int v) {
19    }
20}

Reachabiliity problem: Find all vertices reachable from s along a directed path.

We can use the same dfs method as for undirected graphs.

• Every undirected graph is a digraph with edges in both directions.
• DFS is a digraph algorithm,

Reachability applications:

• program control-flow analysis
• infinite-loop detection
• mark-sweep garbage collector

Other DFS problems:

• Path findind
• Topological sort
• Directed cycle detection

BFS problems:

• shortest path
• multiple-source shortest paths
• web crawler application

Topological Sort

Topological sort: Given a digraph, put the vertices in order such that all its directed edges point from a vertix earlier in the order to a vertex later in the order (or report impossible).

A digraph has a topological order if and only if it is a directed acyclic graph (DAG). Topological sort redraws DAG so all edges poitn upwards.

use DFS again. It can be proved that reverse postorder of a DAG is a topological order. (check P578 for the definition of Preorder/Postorder)

1public class DepthFirstOrder {
2    private boolean[] marked;
3    private Stack<Integer> reversePost;
4
5    publiv DepthFirstOrder(Digraph G) {
6        reversePost = new Stack<Integer>();
7        marked = new boolean[G.V()];
8        for (int v = 0; v < G.V(); v++) {
9            if (!marked[v]) dfs(G, v);
10        }
11    }
12
13    private void dfs(Digrapg G, int v) {
14        marked[v] = true;
15        for (int w : G.adj(v)) {
16            if (!marked[w]) dfs(G, w)
17        }
18        reversePost.push(v);
19    }
20}

Directed cycle detection

To find out if a given digraph is a DAG, we can try to find a directec cycle in the digraph. Use DFS and a stack to track the cycle.

1// TODO

Some very typical applications of directed cycle detection and topological sort: (A directed cycle means the problem is infeasible)

• job schedule
• course scuedule
• inheritance
• vertex: cell
• edge: formula

Strong components

Vertices v and w are strongly connected if there is both a directed path from v to w and a directed path from w to v. Strong connectivity is an equvicalence relation.

Kosaraju-Sharir Algorithm

Kosaraju-Sharir is easy to implement but difficutl to understand. It runs DFS twice:

• Given a digraph G, run DFS to compute the topological order of its reverse $G^R$
• Run DFS on G in the order given by first DFS

https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/KosarajuSharirSCC.java.html

1public class KosarajuSharirSCC {
2    private boolean[] marked;     // marked[v] = has vertex v been visited?
3    private int[] id;             // id[v] = id of strong component containing v
4    private int count;            // number of strongly-connected components
5
6    /**
7     * Computes the strong components of the digraph {@code G}.
8     * @param G the digraph
9     */
10    public KosarajuSharirSCC(Digraph G) {
11
12        // compute reverse postorder of reverse graph
13        DepthFirstOrder dfs = new DepthFirstOrder(G.reverse());
14
15        // run DFS on G, using reverse postorder to guide calculation
16        marked = new boolean[G.V()];
17        id = new int[G.V()];
18        for (int v : dfs.reversePost()) {
19            if (!marked[v]) {
20                dfs(G, v);
21                count++;
22            }
23        }
24    }
25
26    // DFS on graph G
27    private void dfs(Digraph G, int v) {
28        marked[v] = true;
29        id[v] = count;
30        for (int w : G.adj(v)) {
31            if (!marked[w]) dfs(G, w);
32        }
33    }
34
35    // ...
36}

Minimum Spanning Trees

An edge-weighted-graph is a graph where we associate weight or costs with each edge. A spanning tree of an undirected edge-weighted graph G is a subgraph T that is both a tree (conneted and acyclic) and spanning (includes all of the vertices). Given an (connected) undirected edge-weighted graph G with V vertices and E edges, the MST of it must have V - 1 edges. If the graph is not connceted, we compute minimum spanning forest (MST of each component).

• A cut in a graph is a partition of its vertices into two (nonempty) sets
• A crossing edge connects a vertex in one set with a vertex in the other.
• Cut property: Given any cut, the crossing edge of min weight is in the MST.

Greedy MST Algorithm:

• Find cut with no blacked crossing edges; color its min-weight edge black.
• Repeat until V-1 edges are colored black.

Implementations 1: Kruskal’s algorithm

For edges in ascending order of weight:

• Add next edge to Tree unless doing so would create a cycle.

To efficiently solve this problem, use union-find :

1. use a priority queue to maintain all the edges in V
2. union-find data structure:
• maintain a set for each connected component in T.
• if v and w are in saome set, then adding v->w would create a cycle
• to add v>w to T, merge sets containing v and w.

Implementations 2: Prim’s algorithm

• Add To T the min weight edge with exactly oue endpoint in T.
• Reapeat unitl V - 1 edges.

The key to solve this problem is how do we find the crossing edge of minimal weight efficiently.

A lazy solution (in time proportional to $ElogE$, fair enough):

1. Maintain a PQ of edges with (at least) one endpoint in T
• Key = edge, priority = weight
2. Delete-min to determine next edge e = v->w to add to T
3. Disregard if both endpoints v and w are marked (both in T)
4. Otherwise, let w be the unmarked vertex (not in T)
• add to PQ and edge incident to w (assuming other endpoint not in T)
• add e to T and mark w

A eager solution (in time proprotional to $ElogV$, better):

1. Maintain a PQ of vertices connected by an edge to T, where priority of v = weight of shortedt edge connecting v to T
2. Delete min vertex v and add its associated edge e = v->w to T
3. Update PQ by considering all edges e = v->x incident to v
• ignore if x is already in T
• decrease priority of x if v->x becomes shortest edge connecting x to T

This solution uses an indexed priority queue data structure.

Shortest Paths

Some variants:

• Which vertices?
• Single source
• Source-sink
• All pairs
• Edge weights
• Nonegative weights
• Euclidean weights
• Arbitrary weights
• Cycles?
• No directed cycles
• No negative cycles

Edge-weighted digraph data strcuture

Weighted directed edge: https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/DirectedEdge.java.html

Edge-weighted digraph: https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/EdgeWeightedDigraph.java.html

Use adjacency-lists implementation same as EdgeWeightedGraph

Generic Single-source Shortest paths

Our goal is to find the shortest path from s to every other vertex. As a result, what we find will be the shortest-paths tree (SPT) for source s.

Relax edge e = v->w

• distTo[v] is length of shortest known path from s to v
• distTo[w] is length of shortest known path from s to w
• esgeTo[w] is last edge on shortest known pathh from s to w
• if e = v->w gives shorter path to w through v, update both distTo[w] and edgeTo[w]
1private void relax(DirectedEdge e) {
2    int v = e.from(), w = e.to();
3    if (distTo[w] > distTo[v] + e.weight()) {
4        distTo[w] = distTo[v] + e.weight();
5        edgeTo[w] = e;
6    }
7}

Optimality conditions

Given an edge-weighted digraph G, distTo[] are the shortest path distances from s iff:

• distTo[s] = 0
• For each vertex v, distTo[v] is the length of some path from s to v.
• For each edge e = v->w, distTo[w] <= distTo[v] + e.weight()

Generic algorithm

Generic algorithm (to compute SPT from s) {
Initialize distTo[s] = 0 and distTo[v] = $\infty$

Repeat until optimality conditions are satisfied:
- Relax any edge
}

Efficient implementations:

Implement 1: Dijkstra’s algorithm

When there is no nonnegative weight exists, we can use Dijkstra’s algorithm.

• Consider vertices in increasing order of distance from s (non-tree vertex with the lowest distTo[] value)
• add vertex to tree and relax all edges pointing from that vertex
1public class DijkstraSP{
2        // ...
3    public DijkstraSP(EdgeWeightedDigraph G, int s) {
4        edgeTo = new DirectedEdge[G.V()];
5        distTo = new double[G.V()];
6        pq = new IndexMinPQ<Double>(G.V());
7
8        for (int v = 0; v < G.V(); v++) {
9            distTo[v] = Double.POSITIVE_INFINITY;
10        }
11        distTo[s] = 0;
12
13        pq.insert(s, 0.0);
14        while(!pq.isEmpty()) {
15            int v= pq.delMin();
16            for (DirectedEdge e : G.adj(v)) {
17                relax(e);
18            }
19        }
20    }
21
22    private void relax(DirectedEdge e) {
23        int v = e.from(), w = e.to();
24        if (distTo[w] > distTo[v] + e.weight()) {
25            distTo[w] = distTo[v] + e.weight();
26            edgeTo[w] = e;
27            if (pq.contains(w)) pq.decreaseKey(w, distTo[w]);
28            else pq.insert(w, distTo[w]);
29        }
30    }
31}

Compare to Prim’s algorithm:

• Both are computing a graph’s spanning tree
• Prim’s algorithm choose closest vertex to tree as next vertex, while Dijkstra’s algorithm choose closest vertex to the source

Implement 2: Topological sort algorithm

When the graph is a DAG, we can consider vertices in topological order and do relaxing.

1    // ...
2    Topological topological = new Topological(G);
3    for (int v : topological.order()) {
4        for (DirectedEdge e : G.adj(v)) {
5            relax(e);
6        }
7    }

Seam carving: Resize an image without distortion.

Longest paths:

• Formuate as a shortest paths problem in edge-weighted DAGs
• Negate all weights
• Find shortest paths
• Negate weights in result
• Allpication: Parallel job scheduling (Critical path method, CPM).

Implement 3: Bellman-Ford algorithm

A SPT exists iff no negative cycles (a directed cycle whose sum of edge weights is negative).

When we want to find shortest paths with nagative weights, Dijkstra’s algorithms doesn’t work. We can use Bellman-Ford algorithm as long as there is no negative cycle in the graph. (Bellman-Ford algorithm is a dynamic programming algorithm)

• Initialize distTo[s] = 0 and distTo[v] = $\infty$
• Maintain a queue and repeat until the queue is empty or find a cycle:
• Pop vertex v from q
• Relax each edge pointing from v to any vertex w:
• if distTo[w] can be de decreased, update distTo[w] and add w to the queue
1// ...
2    public BellmanFordSP(EdgeWeightedDigraph G, int s) {
3        distTo  = new double[G.V()];
4        edgeTo  = new DirectedEdge[G.V()];
5        onQueue = new boolean[G.V()];
6        for (int v = 0; v < G.V(); v++)
7            distTo[v] = Double.POSITIVE_INFINITY;
8        distTo[s] = 0.0;
9
10        // Bellman-Ford algorithm
11        queue = new Queue<Integer>();
12        queue.enqueue(s);
13        onQueue[s] = true;
14        while (!queue.isEmpty() && !hasNegativeCycle()) {
15            int v = queue.dequeue();
16            onQueue[v] = false;
17            relax(G, v);
18        }
19    }
20
21    private void relax(EdgeWeightedDigraph G, int v) {
22        for (DirectedEdge e : G.adj(v)) {
23            int w = e.to();
24            if (distTo[w] > distTo[v] + e.weight()) {
25                distTo[w] = distTo[v] + e.weight();
26                edgeTo[w] = e;
27                if (!onQueue[w]) {
28                    queue.enqueue(w);
29                    onQueue[w] = true;
30                }
31            }
32            if (++cost % G.V() == 0) {
33                findNegativeCycle();
34                if (hasNegativeCycle()) return;  // found a negative cycle
35            }
36        }
37    }
38

Bellman-Ford algorithm can also be used for finding a negative cycle.

Negative cycle application: arbitrage detection.