This paper analyzes the recruitment dependency network (the “connection map”) in Inazuma Eleven 1 as a directed graph. Nodes represent scoutable characters, edges indicate prerequisite conditions (e.g., having befriended another character or holding a specific item). We compute metrics like indegree, outdegree, connectivity, and identify critical nodes (keystone characters). Results show a small-world topology with several bottlenecks, affecting completionist gameplay.

Here’s a suggested paper structure and content focus: “Graph-Based Analysis of the Recruitment Connection Map in Inazuma Eleven (2008)”

Inazuma Eleven 1 Connection Map File

This paper analyzes the recruitment dependency network (the “connection map”) in Inazuma Eleven 1 as a directed graph. Nodes represent scoutable characters, edges indicate prerequisite conditions (e.g., having befriended another character or holding a specific item). We compute metrics like indegree, outdegree, connectivity, and identify critical nodes (keystone characters). Results show a small-world topology with several bottlenecks, affecting completionist gameplay.

Here’s a suggested paper structure and content focus: “Graph-Based Analysis of the Recruitment Connection Map in Inazuma Eleven (2008)”