zrx_graph/graph/topology/
reachability.rs

1// Copyright (c) 2025-2026 Zensical and contributors
2
3// SPDX-License-Identifier: MIT
4// All contributions are certified under the DCO
5
6// Permission is hereby granted, free of charge, to any person obtaining a copy
7// of this software and associated documentation files (the "Software"), to
8// deal in the Software without restriction, including without limitation the
9// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10// sell copies of the Software, and to permit persons to whom the Software is
11// furnished to do so, subject to the following conditions:
12
13// The above copyright notice and this permission notice shall be included in
14// all copies or substantial portions of the Software.
15
16// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18// FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
19// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
22// IN THE SOFTWARE.
23
24// ----------------------------------------------------------------------------
25
26//! Reachability.
27
28use super::adjacency::Adjacency;
29
30mod distance;
31
32use distance::Distance;
33
34// ----------------------------------------------------------------------------
35// Structs
36// ----------------------------------------------------------------------------
37
38/// Direct reachability.
39#[derive(Debug)]
40pub struct Direct;
41
42// ----------------------------------------------------------------------------
43
44/// Transitive reachability.
45#[derive(Debug)]
46pub struct Transitive {
47    /// Distance matrix.
48    distance: Distance,
49}
50
51// ----------------------------------------------------------------------------
52// Implementations
53// ----------------------------------------------------------------------------
54
55impl Transitive {
56    /// Creates transitive reachability from the given adjacency list.
57    #[must_use]
58    pub fn new(adj: &Adjacency) -> Self {
59        Self { distance: Distance::new(adj) }
60    }
61
62    /// Returns whether there is a path from the source to the target.
63    #[inline]
64    #[must_use]
65    pub fn has_path(&self, source: usize, target: usize) -> bool {
66        self.distance.has_path(source, target)
67    }
68}
zrx_graph/graph/topology/reachability.rs

zrx_graph/graph/topology/
reachability.rs
