Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's ...

This project creates word ladders in directed and undirected graph generated from the words in the text file sub-words. It then finds the strongly connected components in the directed graph.

1. The definitions in an XML document are said to be _____ when the tagging system and definitions in the DTD are all in compliance. (1) M=3; D1 displays ”12”; D2 displays ”6”; D3 displays ”12”. (2) ...