sqlitegraph-cli 3.0.5

use clap::{Parser, Subcommand, ValueEnum};
use std::path::PathBuf;

#[derive(Clone, Debug, ValueEnum, Default)]
pub enum BackendType {
    #[default]
    Sqlite,
    #[cfg(feature = "native-v3")]
    V3,
}

#[derive(Parser)]
#[command(name = "sqlitegraph")]
#[command(about = "SQLiteGraph CLI - Graph database query tool")]
#[command(version)]
pub struct Cli {
    /// Database file path
    #[arg(short, long, default_value = "graph.db")]
    pub db: PathBuf,

    /// Backend type
    #[arg(short, long, value_enum, default_value = "sqlite")]
    pub backend: BackendType,

    /// Allow write operations (default is read-only)
    #[arg(long, global = true)]
    pub write: bool,

    #[command(subcommand)]
    pub command: Commands,
}

#[derive(Subcommand)]
pub enum Commands {
    /// Query using Cypher-like syntax (read-only)
    Query {
        /// Cypher-like query (e.g., "MATCH (n:User) RETURN n.name")
        query: String,
    },

    /// Show database status
    Status {
        /// Use compact output format (single line, no pretty-print)
        #[arg(long)]
        compact: bool,
    },

    /// List all nodes
    List {
        /// Filter by kind
        #[arg(short, long)]
        kind: Option<String>,
    },

    /// Breadth-first search
    Bfs {
        #[arg(short, long)]
        start: i64,
        #[arg(short, long, default_value = "3")]
        depth: u32,
    },

    /// Shortest path
    Path {
        #[arg(short, long)]
        from: i64,
        #[arg(short, long)]
        to: i64,
    },

    /// Get neighbors
    Neighbors {
        #[arg(short, long)]
        id: i64,
        #[arg(short, long, default_value = "outgoing")]
        direction: Direction,
    },

    /// Run graph algorithm
    Algo {
        #[command(subcommand)]
        command: AlgoCommands,
    },

    /// Export graph to file (requires --write)
    Export {
        #[arg(short, long)]
        output: PathBuf,
    },

    /// Import graph from file (requires --write)
    Import {
        #[arg(short, long)]
        input: PathBuf,
    },

    /// Insert node (requires --write)
    Insert {
        #[arg(short, long)]
        kind: String,
        #[arg(short, long)]
        name: String,
        #[arg(short, long)]
        data: Option<String>,
    },

    /// HNSW vector index operations
    Hnsw {
        #[command(subcommand)]
        command: HnswCommands,
    },
}

#[derive(Subcommand)]
pub enum HnswCommands {
    /// Create a new HNSW index (requires --write)
    Create {
        #[arg(short, long)]
        name: String,
        /// Vector dimension
        #[arg(short, long)]
        dim: usize,
        /// Distance metric: cosine, euclidean, or dot
        #[arg(short, long, default_value = "cosine")]
        metric: String,
        /// Max edges per node per layer
        #[arg(long, default_value = "16")]
        m: usize,
        /// Beam width during construction
        #[arg(long, default_value = "200")]
        ef_construction: usize,
    },
    /// Insert a vector into an existing HNSW index (requires --write)
    Insert {
        #[arg(short, long)]
        name: String,
        /// Comma-separated f32 values, e.g. `1.0,0.5,-0.25`
        #[arg(short, long)]
        vector: String,
        /// Optional JSON metadata to attach to the vector
        #[arg(long)]
        metadata: Option<String>,
    },
    /// Search for the k nearest neighbours of a query vector
    Search {
        #[arg(short, long)]
        name: String,
        #[arg(short, long, default_value = "10")]
        k: usize,
        /// Comma-separated f32 values, e.g. `1.0,0.5,-0.25`
        #[arg(short, long)]
        vector: String,
    },
    /// List all HNSW indices loaded on the graph
    List,
    /// Delete an HNSW index (requires --write)
    Delete {
        #[arg(short, long)]
        name: String,
    },
}

#[derive(Subcommand)]
pub enum AlgoCommands {
    /// PageRank centrality
    Pagerank {
        #[arg(short, long, default_value = "100")]
        iterations: usize,
    },
    /// Betweenness centrality
    Betweenness,
    /// Weakly-connected components
    Components,
    /// Strongly-connected components (Tarjan)
    Scc,
    /// Topological sort
    Topo,
    /// Louvain community detection
    Louvain {
        #[arg(short = 'i', long, default_value = "100")]
        max_iterations: usize,
    },
    /// Label-propagation community detection
    LabelProp {
        #[arg(short = 'i', long, default_value = "50")]
        max_iterations: usize,
    },
    /// Find cycles in the graph (bounded)
    Cycles {
        #[arg(short, long, default_value = "100")]
        limit: usize,
    },
    /// Dominator tree from a given entry node
    Dominators {
        /// Entry node id (root of the dominator tree)
        #[arg(short, long)]
        entry: i64,
    },
    /// Critical path through the DAG (uniform edge weights = longest path)
    CriticalPath,
}

#[derive(Clone, Debug, ValueEnum)]
pub enum Direction {
    Incoming,
    Outgoing,
    Both,
}