Struct DfsPathSelector

pub struct DfsPathSelector<CW> { /* private fields */ }

Path selector using depth-first search of the channel graph.

Implementations

impl<CW: EdgeWeighting<U256>> DfsPathSelector<CW>

pub fn new(graph: Arc<RwLock<ChannelGraph>>, cfg: DfsPathSelectorConfig) -> Self

Creates a new path selector with the given config and ChannelGraph.

Trait Implementations

impl<CW: Clone> Clone for DfsPathSelector<CW>

fn clone(&self) -> DfsPathSelector<CW>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<CW: Debug> Debug for DfsPathSelector<CW>

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

Formats the value using the given formatter.

impl<CW> PathSelector for DfsPathSelector<CW>

where CW: EdgeWeighting<U256> + Send + Sync,

fn select_path<'life0, 'async_trait>( &'life0 self, source: Address, destination: Address, min_hops: usize, max_hops: usize, ) -> Pin<Box<dyn Future<Output = Result<ChannelPath>> + Send + 'async_trait>>

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

Attempts to find a path with at least min_hops hops and at most max_hops hops that goes from source to destination. There does not need to be a payment channel to destination, so the path only includes intermediate hops.

The function implements a randomized best-first search through the path space. The graph traversal is bounded by self.max_iterations to prevent from long-running path selection runs.

fn select_auto_path<'life0, 'async_trait>( &'life0 self, source: Address, destination: Address, ) -> Pin<Box<dyn Future<Output = Result<ChannelPath>> + Send + 'async_trait>>

where Self: Sync + 'async_trait, 'life0: 'async_trait,

Constructs a new valid packet Path from source to the given destination. This method uses INTERMEDIATE_HOPS as the maximum number of hops.