========== Welcome to MovieLens Analyzer ========== The files being analyzed are: ./src/ml-latest-small/ratings.csv ./src/ml-latest-small/movies.csv There are 3 choices for defining adjacency: [Option 1] u and v are adjacent if the same 12 users gave the same rating to both movies [Option 2] u and v are adjacent if the same 12 users watched both movies (regardless of rating) [Option 3] u is adjacent to v if at least 33.0% of the users that rated u gave the same rating to v Choose an option to build the graph (1-3): 1 Creating graph...The graph has been created. [Option 1] Print out statistics about the graph [Option 2] Print node information [Option 3] Display shortest path between two nodes [Option 4] Quit Choose an option (1-4): 1 Graph statistics: |V| = 1000 vertices |E| = 31552 edges Density = 0.03158358358358358 Max. degree = 303 (node 176) Diameter = 6 (from 69 to 981) Avg. path length = 2.3549340638338534 [Option 1] Print out statistics about the graph [Option 2] Print node information [Option 3] Display shortest path between two nodes [Option 4] Quit Choose an option (1-4): 2 Enter movie id (1-1000): 500 (500) Lady and the Tramp Num Ratings: 51 Genres: Animation Romance Comedy Children Neighbors: Lion King, The Jurassic Park Pinocchio Cinderella Mary Poppins E.T. the Extra-Terrestrial Raiders of the Lost Ark Groundhog Day Bambi Saving Private Ryan Jungle Book, The Peter Pan Sleeping Beauty Bug's Life, A Ghostbusters Big Who Framed Roger Rabbit? [Option 1] Print out statistics about the graph [Option 2] Print node information [Option 3] Display shortest path between two nodes [Option 4] Quit Choose an option (1-4): 3 Enter starting node (1-1000): 69 Enter ending node (1-1000): 981 Harry Potter and the Deathly Hallows: Part 2 ===> Harry Potter and the Deathly Hallows: Part 1 Harry Potter and the Deathly Hallows: Part 1 ===> Harry Potter and the Goblet of Fire Harry Potter and the Goblet of Fire ===> Incredibles, The Incredibles, The ===> Toy Story Toy Story ===> Happy Gilmore Happy Gilmore ===> Billy Madison [Option 1] Print out statistics about the graph [Option 2] Print node information [Option 3] Display shortest path between two nodes [Option 4] Quit Choose an option (1-4): 4 Exiting...bye