Struct TransitNetwork 

pub struct TransitNetwork<R: Copy, T: CoordNum> {
    pub physical_graph: PhysicalGraph<R, T>,
    pub topology_graph: TopologyGraph,
}

Represents a transit network as a graph with transit nodes and edges.

The struct holds a physical graph and a topological graph which are lower-level representations of the network. TransitNetwork provides a higher-level interface to the physical graph and topological graph.

The struct implements TransitNetworkModifier trait for modifying the underlying physical graph.

Generics

R: Copyable trait bound. This represents the type of the data associated with the network’s routes. T: This represents the type of the coordinates used in the network. It’s expected to implement CoordNum trait.

Fields

• physical_graph: PhysicalGraph<R, T> - The physical graph representing the transit network.
• topology_graph: TopologyGraph - The topological graph representing the transit network.

Fields

physical_graph: PhysicalGraph<R, T>

The physical graph representing the transit network.

topology_graph: TopologyGraph

The topological graph representing the transit network.

Implementations

impl<R: Copy, T: CoordNum> TransitNetwork<R, T>

pub fn new() -> Self

Constructs a new TransitNetwork with an empty PhysicalGraph and TopologyGraph.

Returns

A new TransitNetwork instance.

pub fn get_edge_by_id(&self, edge_id: EdgeId) -> Option<&TransitEdge<T>>

Returns a reference to the TransitNode with the given ID.

Trait Implementations

impl<R: Clone + Copy, T: Clone + CoordNum> Clone for TransitNetwork<R, T>

fn clone(&self) -> TransitNetwork<R, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: Debug + Copy, T: Debug + CoordNum> Debug for TransitNetwork<R, T>

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

Formats the value using the given formatter.

impl<R: Copy, T: CoordNum> Default for TransitNetwork<R, T>

fn default() -> Self

Returns the “default value” for a type.

impl<R: Copy, T: CoordNum> PartialEq for TransitNetwork<R, T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<R: Copy, T: CoordNum> ShortestPath<R, T> for TransitNetwork<R, T>

fn find_shortest_path(&self, from: NodeId, to: NodeId) -> Option<Vec<NodeId>>

Finds the shortest path from the start node to the destination node.

impl<R: Copy, T: CoordNum> ShortestPathWithAccessability<R, T> for TransitNetwork<R, T>

fn calc_edge_cost<F>( &self, from: NodeId, to: NodeId, accessability: &Accessability, edge_cost: &mut F, ) -> f64

where F: FnMut(TransitEdge<T>) -> f64,

Calculates the cost of traversing from one node to another, considering the accessibility of the destination node.

fn find_shortest_path_with_accessability<F>( &self, from: NodeId, to: NodeId, accessability: Accessability, edge_cost: F, ) -> Option<(f64, Vec<NodeId>)>

where F: FnMut(TransitEdge<T>) -> f64,

Finds the shortest path between two nodes considering the accessibility of nodes.

impl<R: Copy, T: CoordNum> TransitNetworkModifier<R, T> for TransitNetwork<R, T>

Implementation of TransitNetworkModifier trait for TransitNetwork.

This implementation delegates the operations to the underlying physical graph.

fn add_node(&mut self, node: TransitNode<R>) -> NodeId

Adds a TransitNode to the physical graph of the network.

Arguments

• node - The TransitNode to be added to the network.

Returns

• NodeId - The ID of the added node.

fn add_edge(&mut self, edge: TransitEdge<T>)

Adds a TransitEdge to the physical graph of the network.

Arguments

• edge - The TransitEdge to be added to the network.

fn add_edge_with_accessibility( &mut self, edge: TransitEdge<T>, accessability: Accessability, )

Adds a TransitEdge to the network with a given accessibility.

impl<R: Copy, T: CoordNum> TransitNetworkRepairer<R, T> for TransitNetwork<R, T>

where Euclidean: Distance<T, R, Coord<T>>,

fn repair_edge(&mut self, node1: NodeId, node2: NodeId)

Repairs the edge between two nodes in the network.

fn repair(&mut self)

Repairs the entire network.