Lab 9: Program 3 Starting Code
Due Date and Submission Requirements
- Due Date: Friday, April 11th at 11:59 p.m.
- Partner Information: You are allowed to work with your program 3 partner, but both members need to submit their lab 9 to D2L
- Submission Instructions: Upload your solutions (.java file) to the BrightSpace(D2L) Lab 9 Dropbox.
The goal of this lab is:
Directions
You will do Part I of program 3: https://www.cs.montana.edu/pearsall/classes/spring2025/232/programs/program3.html. You will be constructing an adjacency list using the actors.txt or actors_small.txt input file.
Your Adjacency List should be a HashMap<String, LinkedList<Edge>>. There are a lot of ways you can construct the graph.
You will probably need a Graph Class, Demo Class, and Edge Class. I am not grading on efficiency, you will defintely have nested for loops.
Required Output
When you run your program, you should print out the adjacency list (if you order is different than what is pictured below, that is fine). When you actually submit program 3, you will need to delete this printing code.
Starting Code
Grading (10 points)
- Your program computs a relevant and correct adjacency list for an input file - 10 points
NOTE: If your code does not compile, correctness cannot be verified, and you won’t receive any points
for your code. Turn in code that compiles!
