@@ -42,7 +42,7 @@ use terraphim_types::{
4242/// When you search for "consensus algorithms", the graph traverses from the
4343/// matched node to connected nodes, finding documents that mention related
4444/// concepts like "raft", "leader election", etc.
45-
45+ ///
4646/// Build the initial thesaurus (basic learning concepts)
4747fn build_initial_thesaurus ( ) -> Thesaurus {
4848 let mut thesaurus = Thesaurus :: new ( "Initial Learnings" . to_string ( ) ) ;
@@ -129,7 +129,7 @@ fn build_enhanced_thesaurus() -> Thesaurus {
129129/// PART 2: Sample Learning Documents
130130/// ============================================================================
131131/// These represent notes captured from technical books, courses, and research.
132-
132+ ///
133133fn create_learning_documents ( ) -> Vec < Document > {
134134 vec ! [
135135 Document {
@@ -247,7 +247,7 @@ Prevents use-after-free, double-free, and data races."#
247247/// ============================================================================
248248/// PART 3: Demonstrating Graph Embedding and Indexing
249249/// ============================================================================
250-
250+ ///
251251async fn demonstrate_embedding (
252252 rolegraph : & mut RoleGraph ,
253253 docs : & [ Document ] ,
@@ -292,7 +292,7 @@ async fn demonstrate_embedding(
292292/// ============================================================================
293293/// This is the key demonstration: how adding domain-specific terms improves
294294/// retrieval quality.
295-
295+ ///
296296async fn compare_rankings (
297297 initial_graph : & RoleGraph ,
298298 enhanced_graph : & RoleGraph ,
@@ -372,7 +372,7 @@ async fn compare_rankings(
372372/// PART 5: Connectivity Analysis
373373/// ============================================================================
374374/// Shows how graph connectivity indicates semantic coherence
375-
375+ ///
376376fn demonstrate_connectivity ( rolegraph : & RoleGraph , queries : & [ & str ] ) {
377377 println ! ( "\n 🕸️ Semantic Connectivity Analysis" ) ;
378378 println ! ( " (Checks if query terms are connected in the knowledge graph)" ) ;
0 commit comments