lattix 0.8.1

Knowledge graph data structures
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

//! Basic triple graph queries.
//!
//! Run:
//! `cargo run --example triples`

use lattix::{KnowledgeGraph, Triple};

fn main() {
    let mut kg = KnowledgeGraph::new();
    kg.add_triple(Triple::new("Apple", "founded_by", "Steve Jobs"));
    kg.add_triple(Triple::new("Apple", "headquartered_in", "Cupertino"));
    kg.add_triple(Triple::new("Steve Jobs", "born_in", "San Francisco"));
    kg.add_triple(Triple::new("Cupertino", "located_in", "California"));
    kg.add_triple(Triple::new("San Francisco", "located_in", "California"));

    println!("entities: {}", kg.entity_count());
    println!("triples:  {}", kg.triple_count());

    println!("\nrelations from Apple:");
    for triple in kg.relations_from("Apple") {
        println!(
            "  {} --{}--> {}",
            triple.subject(),
            triple.predicate(),
            triple.object()
        );
    }

    println!("\nentities connected to California:");
    for triple in kg.relations_to("California") {
        println!("  {} via {}", triple.subject(), triple.predicate());
    }

    let path = kg
        .find_path("Apple", "California")
        .expect("Apple should reach California");
    println!("\npath Apple -> California ({} hops):", path.len());
    for triple in &path {
        println!(
            "  {} --{}--> {}",
            triple.subject(),
            triple.predicate(),
            triple.object()
        );
    }

    assert_eq!(kg.relations_from("Apple").len(), 2);
    assert_eq!(kg.relations_to("California").len(), 2);
    assert_eq!(path.len(), 2);
}