Crossword Puzzle Of The Week #17 (for Graphs)

In this issue of Crossword Puzzle of the Week, we will dive into the topic of Graphs The solution to the crossword puzzle is provided at the end.

Crossword Puzzle Of The Week #17 (for Graphs)

HINTS:

DOWN:

1. _____ for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge u v, vertex u comes before v in the ordering.

2. Two sets are called _____ if they don’t have any element in common, the intersection of these sets is a null set.

3. _____ algorithm is a Greedy algorithm. This algorithm always starts with a single node and moves through several adjacent nodes, in order to explore all of the connected edges along the way.

4. In _____ algorithm, sort all edges of the given graph in increasing order. Then it keeps on adding new edges and nodes in the MST if the newly added edge does not form a cycle. It picks the minimum weighted edge at first and the maximum weighted edge at last.

5. A graph is _____: each edge is an unordered pair {u,v} of vertices, and we don’t regard either of the two vertices as having a distinct role from the other.

ACROSS:

1. _____ of a directed graph G is another directed graph on the same set of vertices with all of the edges reversed compared to the orientation of the corresponding edges in G. That is, if G contains an edge (u, v) then this form of G contains an edge (v, u) and vice versa.

6. The _____ Algorithm is for solving all pairs of shortest-path problems. The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed Graph. It is an algorithm for finding the shortest path between all the pairs of vertices in a weighted graph. This algorithm follows the dynamic programming approach to find the shortest path.

7. _____ algorithm works by keeping track of the number of incoming edges into each node (indegree). It is an algorithm used for topological sorting.

8. The algorithm maintains a set of visited vertices and a set of unvisited vertices. It starts at the source vertex and iteratively selects the unvisited vertex with the smallest tentative distance from the source. It then visits the neighbors of this vertex and updates their tentative distances if a shorter path is found.

9. A ____ graph is a graph in which the vertices can be divided into two disjoint sets, such that no two vertices within the same set are adjacent. In other words, it is a graph in which every edge connects a vertex of one set to a vertex of the other set.

Solution for Crossword Puzzle #17:

Crossword Puzzle Of The Week #17 (for Graphs)

Answers:

DOWN:

1. TOPOLOGICAL SORT

2. DISJOINT SET

3. PRIMS

4. KRUSKALS

5. UNDIRECTED

ACROSS:

1. TRANSPOSE

6. FLOYD WARSHALL

7. KAHNS

8. DIJKSTRAS

9. BIPARTITE