1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
//! This module provides abstractions and implementations for modifying a transit network. A transit network is represented as a graph,
//! where each node is a `TransitNode` (a point in the transit network where a vehicle can stop) and each edge represents a path
//! (`TransitEdge`) between two transit nodes. The main trait provided by this module is `TransitNetworkModifier`.
//!
//! ## `TransitNetworkModifier`
//!
//! The `TransitNetworkModifier` trait provides an interface for modifying the network. This includes adding nodes and edges to the network.
//! Implementors of this trait can be used to add `TransitNode` and `TransitEdge` instances to a network.
//!
//! For instance, an implementor might add a `TransitNode` to an internal data structure upon invocation of the `add_node` method.
//! Similarly, the `add_edge` and `add_edge_with_accessibility` methods are used to add `TransitEdge` instances to the network.
//! The `add_edge_with_accessibility` method also allows specifying the accessibility of the edge, represented by the `Accessability` enum.
//!
use crate::core::{Accessability, NodeId, TransitEdge, TransitNode};
use geo::{Coord, CoordNum, EuclideanDistance};
/// Trait providing methods for modifying a transit network.
///
/// This trait provides an abstraction for modifying a transit network, which is represented as a graph with `TransitNode` instances as nodes and `TransitEdge` instances as edges.
pub trait TransitNetworkModifier<R, T: CoordNum> {
/// Adds a `TransitNode` to the network.
///
/// # Arguments
///
/// * `node` - The `TransitNode` to be added to the network.
///
/// # Returns
///
/// * `NodeId` - The ID of the added node.
fn add_node(&mut self, node: TransitNode<R>) -> NodeId;
/// Adds a `TransitEdge` to the network.
///
/// # Arguments
///
/// * `edge` - The `TransitEdge` to be added to the network.
fn add_edge(&mut self, edge: TransitEdge<T>);
/// Adds a `TransitEdge` to the network with a given accessibility.
///
/// # Arguments
///
/// * `edge` - The `TransitEdge` to be added to the network.
/// * `accessibility` - The `Accessability` of the edge.
fn add_edge_with_accessibility(&mut self, edge: TransitEdge<T>, accessibility: Accessability);
}
/// A trait for repairing transit networks, particularly for ensuring that all edges in the network are in the correct direction.
///
/// This trait provides two methods:
///
/// * `repair_edge`: Repairs a specific edge between two nodes.
/// * `repair`: Repairs the entire network.
///
/// The trait is generic over two parameters:
///
/// * `R`, which must implement the `EuclideanDistance` trait, used for calculating distances between nodes.
/// * `T`, which must implement the `CoordNum` trait, representing the type of the coordinates of nodes in the network.
///
/// # Types
///
/// * `R`: A type that can be used to calculate Euclidean distances.
/// * `T`: A type that represents the coordinate system used by the nodes in the network.
///
pub trait TransitNetworkRepairer<R, T: CoordNum>
where
R: EuclideanDistance<T, Coord<T>>,
{
/// Repairs the edge between two nodes in the network.
///
/// If the edge is not in the correct direction (according to some
/// network-specific criterion), this method will modify the network
/// to correct the edge's direction.
///
/// # Arguments
///
/// * `node1` - The ID of the first node connected by the edge to be repaired.
/// * `node2` - The ID of the second node connected by the edge to be repaired.
///
fn repair_edge(&mut self, node1: NodeId, node2: NodeId);
/// Repairs the entire network.
///
/// This method will iterate over all the edges in the network and
/// repair them using the same criterion as `repair_edge`.
///
fn repair(&mut self);
}