Skip to content

Learning Graph Quality Metrics Report

Overview

  • Total Concepts: 254
  • Foundational Concepts (no prerequisites, other concepts depend on them): 7
  • Terminal Nodes (nothing depends on them, but have prerequisites): 110
  • Orphaned Nodes (completely disconnected, no edges): 0
  • Concepts with Dependencies: 247
  • Average Dependencies per Concept: 1.84

Graph Structure Validation

  • Valid DAG Structure: ✅ Yes
  • Self-Dependencies: None detected ✅
  • Cycles Detected: 0

Foundational Concepts

These concepts have no prerequisites:

  • 1: Architecture Tradeoff Analysis
  • 23: Database Management System
  • 127: CAP Theorem
  • 147: Atomicity
  • 199: High Availability
  • 214: Vector Embedding
  • 228: Large Language Model

Dependency Chain Analysis

  • Maximum Dependency Chain Length: 11

Longest Learning Path:

  1. Database Management System (ID: 23)
  2. Workload Characterization (ID: 31)
  3. Read/Write Ratio (ID: 32)
  4. OLAP Workload (ID: 35)
  5. Columnar Storage (ID: 61)
  6. Massively Parallel Processing (ID: 62)
  7. Snowflake Database (ID: 73)
  8. Database Selection Framework (ID: 244)
  9. Total Cost of Ownership (ID: 246)
  10. Vendor Lock-In Risk (ID: 247)
  11. Database Deprecation Risk (ID: 253)

Terminal Nodes Analysis

Terminal nodes are concepts that nothing else depends on but have prerequisites. They represent natural endpoints of learning paths — culminating or specialized concepts.

  • Total Terminal Nodes: 110 (43.3% of all concepts)
  • Healthy Range: 5-40% of total concepts

Concepts at the end of learning paths:

  • 9: Non-Risk
  • 10: Risk Theme
  • 11: Utility Tree Prioritization
  • 18: Quality Attribute Refinement
  • 20: Scenario Response Measure
  • 21: ATAM Output Artifacts
  • 22: Software Architecture View
  • 39: Query Expressiveness
  • 47: Third Normal Form
  • 48: Join Operation
  • 50: Query Execution Plan
  • 51: Stored Procedure
  • 54: Write-Ahead Log
  • 57: Deadlock Detection
  • 58: Connection Pooling
  • 60: MySQL
  • 65: Snowflake Schema
  • 66: OLAP Cube
  • 68: Inmon Architecture
  • 69: Kimball Architecture

...and 90 more

Orphaned Nodes Analysis

Orphaned nodes are completely disconnected concepts with no inbound AND no outbound edges. These indicate a quality problem — every concept should connect to the graph.

  • Total Orphaned Nodes: 0

✅ No orphaned nodes detected. All concepts are connected to the graph.

Connected Components

  • Number of Connected Components: 1

✅ All concepts are connected in a single graph.

Indegree Analysis

Top 10 concepts that are prerequisites for the most other concepts:

Rank Concept ID Concept Label Indegree
1 23 Database Management System 12
2 24 Data Model 12
3 127 CAP Theorem 12
4 199 High Availability 11
5 214 Vector Embedding 11
6 27 Database Index 10
7 41 Relational Data Model 10
8 115 Document Data Model 10
9 26 Query Language 8
10 147 Atomicity 8

Outdegree Distribution

Dependencies Number of Concepts
0 7
1 86
2 128
3 28
4 2
5 1
7 1
9 1

Recommendations

  • ℹ️ High terminal node percentage (43.3%): Consider if some terminal concepts should be prerequisites for advanced concepts
  • ✅ DAG structure verified: Graph supports valid learning progressions

Report generated by learning-graph-reports/analyze_graph.py