Struct GraphCommunityTool 

pub struct GraphCommunityTool { /* private fields */ }

graph.community — detect communities using label propagation.

Runs label propagation on the association graph to detect clusters of tightly connected memories. Each node adopts the label shared by the majority of its neighbors. Iterates until convergence or max rounds.

Implementations

impl GraphCommunityTool

pub fn new(store: Arc<MemoryStore>) -> Self

Trait Implementations

impl Tool for GraphCommunityTool

fn name(&self) -> &str

Unique tool name (e.g., “memory.create”, “search.hybrid”)

fn gana(&self) -> Gana

Which Gana this tool belongs to.

fn effects(&self) -> &EffectRow

Effect row — what this tool does to the world.

fn description(&self) -> &str

Human-readable description.

fn call<'life0, 'life1, 'async_trait>( &'life0 self, _ctx: &'life1 mut Context, args: Value, ) -> Pin<Box<dyn Future<Output = Result<Value>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Execute the tool.

fn stats(&self) -> &ToolStats

Access this tool’s statistics.

fn input_schema(&self) -> Value

JSON-Schema-style description of the accepted arguments.