Learning Graph Quality Metrics Report¶
Overview¶
- Total Concepts: 200
- Foundational Concepts (no prerequisites, other concepts depend on them): 4
- Terminal Nodes (nothing depends on them, but have prerequisites): 66
- Orphaned Nodes (completely disconnected, no edges): 0
- Concepts with Dependencies: 196
- Average Dependencies per Concept: 1.53
Graph Structure Validation¶
- Valid DAG Structure: ✅ Yes
- Self-Dependencies: None detected ✅
- Cycles Detected: 0
Foundational Concepts¶
These concepts have no prerequisites:
- 1: Node
- 16: Relational Table
- 18: Document Store
- 153: Large Language Model
Dependency Chain Analysis¶
- Maximum Dependency Chain Length: 17
Longest Learning Path:¶
- Node (ID: 1)
- Entity (ID: 11)
- Taxonomy (ID: 27)
- Controlled Vocabulary (ID: 28)
- Thesaurus (ID: 29)
- Ontology (ID: 36)
- Upper Ontology (ID: 40)
- Domain Ontology (ID: 41)
- Knowledge Graph (ID: 53)
- Data Source (ID: 89)
- ETL Pipeline (ID: 90)
- Data Ingestion (ID: 91)
- Entity Extraction (ID: 92)
- Named Entity Recognition (ID: 93)
- Relation Extraction (ID: 94)
- Knowledge Extraction (ID: 101)
- Information Extraction (ID: 103)
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: 66 (33.0% of all concepts)
- Healthy Range: 5-40% of total concepts
Concepts at the end of learning paths:
- 64: Data Model
- 72: SKOS
- 77: Turtle Syntax
- 78: JSON-LD
- 79: N-Triples
- 80: XML Schema Datatype
- 83: Equivalent Class
- 84: Disjoint Classes
- 85: Transitive Property
- 86: Symmetric Property
- 87: Inverse Property
- 88: Cardinality Restriction
- 96: Deduplication
- 97: Record Linkage
- 99: Schema Mapping
- 102: Text Mining
- 103: Information Extraction
- 104: Data Enrichment
- 106: SELECT Query
- 107: CONSTRUCT Query
...and 46 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 | 5 | Graph | 12 |
| 2 | 53 | Knowledge Graph | 10 |
| 3 | 43 | RDF Triple | 9 |
| 4 | 69 | RDF | 8 |
| 5 | 105 | SPARQL Query | 8 |
| 6 | 15 | Graph Traversal | 7 |
| 7 | 27 | Taxonomy | 7 |
| 8 | 121 | Centrality | 7 |
| 9 | 179 | Matter Graph | 7 |
| 10 | 11 | Entity | 6 |
Outdegree Distribution¶
| Dependencies | Number of Concepts |
|---|---|
| 0 | 4 |
| 1 | 123 |
| 2 | 59 |
| 3 | 9 |
| 4 | 1 |
| 5 | 1 |
| 7 | 2 |
| 8 | 1 |
Recommendations¶
- ✅ Terminal node percentage (33.0%): Within healthy range (5-40%)
- ✅ DAG structure verified: Graph supports valid learning progressions
- ℹ️ Long dependency chains (17): Ensure students can follow extended learning paths
Report generated by learning-graph-reports/analyze_graph.py