Module: 01

Assignment: Read and review overall project Requirements

Module: 02

Assignment: Create a Java program that implements the stack data structure

Module: 03

Assignment: Create a Java program that builds a directed graph

Module: 04

Assignment: Create a Java program that performs a depth-first search to create a class compiling order

Module: 05

Assignment: Put together a complete solution that implements the functionality developed in weeks 2, 3, and 4

Instructions: To determine the dependencies of the classes/modules that make up the operating system, you are going to create a module that implements a directed graph. This module should be able to read a list of vertices along with their edges from a text file and return the adjacency lists for the involved module.

Input:

0-> 1, 4

1-> 0, 2, 3, 4

2-> 1, 3

3-> 1, 2, 4

4-> 0, 1, 3

Your output will resemble the following:

Output:

Adjacency list of vertex 0

head -> 1-> 4

Adjacency list of vertex 1

head -> 0-> 2-> 3-> 4

Adjacency list of vertex 2

head -> 1-> 3

Adjacency list of vertex 3

head -> 1-> 2-> 4

Adjacency list of vertex 4

head -> 0-> 1-> 3