Struct ArrowGraph

Source
pub struct ArrowGraph {
    pub nodes: RecordBatch,
    pub edges: RecordBatch,
    pub indexes: GraphIndexes,
}

Fields§

§nodes: RecordBatch§edges: RecordBatch§indexes: GraphIndexes

Implementations§

Source§

impl ArrowGraph

Source

pub fn new(nodes: RecordBatch, edges: RecordBatch) -> Result<Self>

Create a new graph from nodes and edges RecordBatches

Source

pub fn from_edges(edges: RecordBatch) -> Result<Self>

Create a graph from just edges (nodes will be inferred)

Source

pub fn empty() -> Result<Self>

Create an empty graph with no nodes or edges

Source

pub async fn from_files<P: AsRef<Path>>( _nodes_path: P, _edges_path: P, ) -> Result<Self>

Load graph from Arrow/Parquet files

Source

pub fn from_tables(nodes: RecordBatch, edges: RecordBatch) -> Result<Self>

Create graph from RecordBatches (alias for new)

Source

pub async fn sql(&self, _query: &str) -> Result<RecordBatch>

Execute SQL query with graph functions

Source

pub fn node_count(&self) -> usize

Get number of nodes in the graph

Source

pub fn edge_count(&self) -> usize

Get number of edges in the graph

Source

pub fn density(&self) -> f64

Calculate graph density (edges / max_possible_edges)

Source

pub fn neighbors(&self, node_id: &str) -> Option<&Vec<String>>

Get neighbors of a node

Source

pub fn predecessors(&self, node_id: &str) -> Option<&Vec<String>>

Get predecessors of a node (incoming edges)

Source

pub fn has_node(&self, node_id: &str) -> bool

Check if node exists in graph

Source

pub fn edge_weight(&self, source: &str, target: &str) -> Option<f64>

Get edge weight between two nodes

Source

pub fn node_ids(&self) -> impl Iterator<Item = &String>

Get all node IDs

Source

pub fn add_node(&mut self, node_id: String) -> Result<()>

Add a new node to the graph

Source

pub fn remove_node(&mut self, node_id: &str) -> Result<()>

Remove a node from the graph (also removes all incident edges)

Source

pub fn add_edge( &mut self, source: String, target: String, weight: Option<f64>, ) -> Result<()>

Add an edge to the graph

Source

pub fn remove_edge(&mut self, source: &str, target: &str) -> Result<()>

Remove an edge from the graph

Trait Implementations§

Source§

impl Clone for ArrowGraph

Source§

fn clone(&self) -> ArrowGraph

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for ArrowGraph

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> ErasedDestructor for T
where T: 'static,