pub struct ShortestPath { /* private fields */ }Expand description
Shortest path kernel using BFS (unweighted) or Delta-Stepping (weighted).
Implementations§
Source§impl ShortestPath
impl ShortestPath
Sourcepub fn compute_sssp_bfs(
graph: &CsrGraph,
source: usize,
) -> Vec<ShortestPathResult>
pub fn compute_sssp_bfs( graph: &CsrGraph, source: usize, ) -> Vec<ShortestPathResult>
Compute single-source shortest paths using BFS (for unweighted graphs).
§Arguments
graph- Input graph (CSR format)source- Source node index
Sourcepub fn compute_sssp_dijkstra(
graph: &CsrGraph,
source: usize,
weights: &[f64],
) -> Vec<ShortestPathResult>
pub fn compute_sssp_dijkstra( graph: &CsrGraph, source: usize, weights: &[f64], ) -> Vec<ShortestPathResult>
Compute single-source shortest paths using Dijkstra (for weighted graphs).
§Arguments
graph- Input graph (CSR format)source- Source node indexweights- Edge weights (parallel to graph edges)
Sourcepub fn compute_apsp(graph: &CsrGraph) -> AllPairsResult
pub fn compute_apsp(graph: &CsrGraph) -> AllPairsResult
Compute all-pairs shortest paths.
Sourcepub fn reconstruct_path(
sssp: &[ShortestPathResult],
source: usize,
target: usize,
) -> Option<Vec<usize>>
pub fn reconstruct_path( sssp: &[ShortestPathResult], source: usize, target: usize, ) -> Option<Vec<usize>>
Reconstruct path from source to target.
Sourcepub fn compute_path(
graph: &CsrGraph,
source: usize,
target: usize,
) -> Option<PathResult>
pub fn compute_path( graph: &CsrGraph, source: usize, target: usize, ) -> Option<PathResult>
Compute shortest path between two nodes.
Sourcepub fn compute_k_shortest(
graph: &CsrGraph,
source: usize,
target: usize,
k: usize,
) -> Vec<PathResult>
pub fn compute_k_shortest( graph: &CsrGraph, source: usize, target: usize, k: usize, ) -> Vec<PathResult>
Find k shortest paths using Yen’s algorithm.
Sourcepub fn compute_eccentricity(graph: &CsrGraph) -> Vec<f64>
pub fn compute_eccentricity(graph: &CsrGraph) -> Vec<f64>
Compute eccentricity for each node (max distance to any other node).
Sourcepub fn compute_diameter(graph: &CsrGraph) -> f64
pub fn compute_diameter(graph: &CsrGraph) -> f64
Compute graph diameter (max eccentricity).
Sourcepub fn compute_radius(graph: &CsrGraph) -> f64
pub fn compute_radius(graph: &CsrGraph) -> f64
Compute graph radius (min eccentricity).
Trait Implementations§
Source§impl Clone for ShortestPath
impl Clone for ShortestPath
Source§fn clone(&self) -> ShortestPath
fn clone(&self) -> ShortestPath
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for ShortestPath
impl Debug for ShortestPath
Source§impl Default for ShortestPath
impl Default for ShortestPath
Source§impl GpuKernel for ShortestPath
impl GpuKernel for ShortestPath
Source§fn metadata(&self) -> &KernelMetadata
fn metadata(&self) -> &KernelMetadata
Returns the kernel metadata.
Source§fn requires_gpu_native(&self) -> bool
fn requires_gpu_native(&self) -> bool
Returns true if this kernel requires GPU-native execution.
Source§fn health_check(&self) -> HealthStatus
fn health_check(&self) -> HealthStatus
Perform a health check on this kernel. Read more
Source§fn refresh_config(&mut self, _config: &KernelConfig) -> Result<(), KernelError>
fn refresh_config(&mut self, _config: &KernelConfig) -> Result<(), KernelError>
Refresh kernel configuration at runtime. Read more
Auto Trait Implementations§
impl Freeze for ShortestPath
impl RefUnwindSafe for ShortestPath
impl Send for ShortestPath
impl Sync for ShortestPath
impl Unpin for ShortestPath
impl UnwindSafe for ShortestPath
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<F, W, T, D> Deserialize<With<T, W>, D> for F
impl<F, W, T, D> Deserialize<With<T, W>, D> for F
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Gets the layout of the type.