Struct KnowledgeGraph 

pub struct KnowledgeGraph {

    pub projects: Vec<Model>,
    pub project_platforms: Vec<Model>,
    pub categories: Vec<Model>,
    pub nodes: Vec<Model>,
    pub semantic_functions: Vec<Model>,
    pub project_categories: Vec<Model>,
    pub project_semantics: Vec<Model>,
    pub semantic_merges: Vec<Model>,
    pub findings: Vec<Model>,
    pub finding_categories: Vec<Model>,
    pub audit_finding_categories: Vec<Model>,
    pub project_findings: Vec<Model>,
    pub semantic_finding_links: Vec<Model>,
    pub finding_link_statuses: Vec<Model>,
    pub finding_merges: Vec<Model>,
}

In-memory representation of the full knowledge graph. Built via HistoricalDatabase::load_knowledge_graph().

Fields

projects: Vec<Model>

project_platforms: Vec<Model>

categories: Vec<Model>

nodes: Vec<Model>

semantic_functions: Vec<Model>

project_categories: Vec<Model>

project_semantics: Vec<Model>

Project ↔ semantic provenance edges. Replaces the old scalar semantic_node.project_id so that a single canonical semantic (the merge target — the surviving node after raw siblings fold into it) can list every contributing project.

semantic_merges: Vec<Model>

findings: Vec<Model>

finding_categories: Vec<Model>

audit_finding_categories: Vec<Model>

project_findings: Vec<Model>

Project ↔ finding provenance edges. Replaces the old scalar audit_finding.project_id for the same reason.

semantic_finding_links: Vec<Model>

finding_link_statuses: Vec<Model>

Per-finding completion marker. A finding’s sfl rows are only downstream-visible once a row for it lands here, so the status set must round-trip through snapshots — otherwise a freshly-restored DB would have orphaned sfl rows that load_knowledge_graph’s gate filters out, and the snapshot would no longer be self-contained.

finding_merges: Vec<Model>

Implementations

impl KnowledgeGraph

pub fn export_dot(&self) -> String

Export the knowledge graph as a GraphViz DOT string.

pub fn export_html( &self, graph_data_script_url: &str, details_script_url: &str, viewport_edge_limit: usize, project_rows: usize, semantic_rows: usize, finding_rows: usize, ) -> Result<HtmlExportAssets>

Export the knowledge graph as an interactive HTML page backed by vis-network. Node labels stay concise, while all details are embedded into the page and shown in a side panel when selected.

Trait Implementations

impl Clone for KnowledgeGraph

fn clone(&self) -> KnowledgeGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for KnowledgeGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for KnowledgeGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for KnowledgeGraph

impl PartialEq for KnowledgeGraph

fn eq(&self, other: &KnowledgeGraph) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for KnowledgeGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for KnowledgeGraph