Learning Graph Quality Metrics Report
Overview
- Total Concepts: 200
- Foundational Concepts (no prerequisites, other concepts depend on them): 6
- Terminal Nodes (nothing depends on them, but have prerequisites): 69
- Orphaned Nodes (completely disconnected, no edges): 0
- Concepts with Dependencies: 194
- Average Dependencies per Concept: 1.80
Graph Structure Validation
- Valid DAG Structure: ✅ Yes
- Self-Dependencies: None detected ✅
- Cycles Detected: 0
Foundational Concepts
These concepts have no prerequisites:
- 1: Trust
- 3: Network Fundamentals
- 14: Hash Function
- 119: Architecture
- 134: Business Requirement
- 143: Cognitive Bias
Dependency Chain Analysis
- Maximum Dependency Chain Length: 18
Longest Learning Path:
- Network Fundamentals (ID: 3)
- Internet Architecture (ID: 4)
- Peer-to-Peer Networks (ID: 6)
- Distributed System (ID: 36)
- Distributed Ledger (ID: 37)
- Immutability (ID: 39)
- Blockchain Definition (ID: 41)
- Consensus Mechanism (ID: 58)
- Proof of Work (ID: 59)
- Mining (ID: 53)
- Computational Cost (ID: 105)
- Network Cost Analysis (ID: 107)
- Total Cost of Ownership (ID: 109)
- Cost-Benefit Analysis (ID: 112)
- Technology Evaluation (ID: 191)
- Proof of Concept (ID: 193)
- Pilot Program (ID: 194)
- Implementation Roadmap (ID: 195)
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: 69 (34.5% of all concepts)
- Healthy Range: 5-40% of total concepts
Concepts at the end of learning paths:
- 8: Symmetric Encryption
- 16: SHA-256
- 18: Merkle Tree
- 20: Tamper Evidence
- 21: Non-Repudiation
- 30: Certificate Revocation
- 32: CA Compromise Scenarios
- 33: Trust Anchor
- 38: Ledger Replication
- 40: Append-Only Data
- 43: Block Header
- 44: Block Body
- 45: Genesis Block
- 47: Transaction Validation
- 49: Mempool
- 52: Light Node
- 54: Miner
- 55: Mining Reward
- 56: Difficulty Adjustment
- 61: Delegated Proof of Stake
...and 49 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 | 41 | Blockchain Definition | 26 |
| 2 | 143 | Cognitive Bias | 15 |
| 3 | 122 | Quality Attribute | 10 |
| 4 | 46 | Transaction | 8 |
| 5 | 1 | Trust | 7 |
| 6 | 15 | Cryptographic Hash | 7 |
| 7 | 36 | Distributed System | 7 |
| 8 | 166 | Case Study Analysis | 7 |
| 9 | 79 | Smart Contract | 6 |
| 10 | 121 | ATAM Overview | 6 |
Outdegree Distribution
| Dependencies | Number of Concepts |
|---|---|
| 0 | 6 |
| 1 | 63 |
| 2 | 114 |
| 3 | 13 |
| 4 | 3 |
| 7 | 1 |
Recommendations
- ✅ Terminal node percentage (34.5%): Within healthy range (5-40%)
- ✅ DAG structure verified: Graph supports valid learning progressions
- ℹ️ Long dependency chains (18): Ensure students can follow extended learning paths
Report generated by learning-graph-reports/analyze_graph.py