openai / openai-icpc-2025
Components

An overview of source code logical components.

Intro

Logical decomposition is a representation of the organization of the main source code, where every and each file is put in exactly one logical component.

  • A software system can have one or more logical decompositions.
  • A logical decomposition can be defined in two ways in Sokrates.
  • First approach is based on the folders structure. Components are mapped to folders at defined folder depth relative to the source code root.
  • Second approach is based on explicit definition of each component. In such explicit definitions, components are explicitly named and their files are selected based on explicitly defined path and content filters.
  • A logical decomposition is considered invalid if a file is selected into two or more components. This constraint is introduced in order to facilitate measuring of dependencies among components.
  • Files not assigned to any component are put into a special "Unclassified" component.
Logical Decompositions Overview

Analyzed system has 1 logical decomposition:

  • primary (12 components)

Logical Decomposition #1: PRIMARY

The decompositions is based on the folder structure at level 1 (relative to the source code root).

Bubble Chart | Tree Map
Component Sizes (Lines of Code)
The "primary" logical decomposition has 12 components.
  • 20 files, 3,121 LOC (100.0% vs. main code).
  • "G-Lava Moat" is biggest, containing 72.77% of LOC.
  • "B-Blackboard Game" is smallest, containing 1.19% of LOC.


G-Lava Moat2271 LOC (72%) 9 files
C-Bride of Pipe Stream130 LOC (4%) 1 file
H-Score Values130 LOC (4%) 1 file
E-Delivery Service94 LOC (3%) 1 file
A-A-Skew-ed Reasoning91 LOC (2%) 1 file
I-Slot Machine69 LOC (2%) 1 file
K-Treasure Map66 LOC (2%) 1 file
D-Buggy Rover65 LOC (2%) 1 file
F-Herding Cats64 LOC (2%) 1 file
J-Stacking Cups61 LOC (1%) 1 file
L-Walking on Sunshine43 LOC (1%) 1 file
B-Blackboard Game37 LOC (1%) 1 file


2026-06-24 10:40