Struct RoadNetwork 

pub struct RoadNetwork {
    pub nodes: HashMap<u32, RoadNetworkNode>,
    pub edges: HashMap<u32, RoadNetworkEdge>,
    pub next_node_id: u32,
    pub next_edge_id: u32,
    pub adjacency: HashMap<u32, Vec<(u32, f64)>>,
}

Fields

nodes: HashMap<u32, RoadNetworkNode>

edges: HashMap<u32, RoadNetworkEdge>

next_node_id: u32

next_edge_id: u32

adjacency: HashMap<u32, Vec<(u32, f64)>>

Implementations

impl RoadNetwork

pub fn new() -> Self

pub fn add_node(&mut self, pos: Vec3, nt: RoadNodeType) -> u32

pub fn add_edge( &mut self, from: u32, to: u32, len: f32, speed: f32, rt: RoadType, lanes: u32, _is_one_way: bool, ) -> u32

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn dijkstra(&self, start: u32, goal: u32) -> Option<(f64, Vec<u32>)>