Struct caminos_lib::topology::projective::Projective

pub struct Projective { /* private fields */ }

The projective topology. Erdos, Renyi graph Or Brown graph Used by Brahme as a network topology, with other definition.

Implementations

impl Projective

pub fn new(arg: TopologyBuilderArgument<'_>) -> Projective

Trait Implementations

impl Debug for Projective

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

Formats the value using the given formatter.

impl Quantifiable for Projective

fn total_memory(&self) -> usize

Get the total memory currently being employed by the implementing type. Both stack and heap.

fn print_memory_breakdown(&self)

Prints by stdout how much memory is used per component.

fn forecast_total_memory(&self) -> usize

Get an estimation on how much memory the type could reach during the simulation.

impl Topology for Projective

fn neighbour(&self, router_index: usize, port: usize) -> (Location, usize)

Neighbours of a router: Location+link class index Routers should be before servers

fn server_neighbour(&self, server_index: usize) -> (Location, usize)

The neighbour of a server: Location+link class index

fn diameter(&self) -> usize

the greatest distance from server to server

fn distance(&self, origin: usize, destination: usize) -> usize

Distance from a router to another.

fn amount_shortest_paths(&self, _origin: usize, _destination: usize) -> usize

Number of shortest paths from a router to another.

fn average_amount_shortest_paths(&self) -> f32

Average number of shortest paths from a router to another.

fn degree(&self, router_index: usize) -> usize

Number of ports used to other routers.

fn cartesian_data(&self) -> Option<&CartesianData>

Specific for some toologies, but must be checkable for anyone

fn coordinated_routing_record( &self, _coordinates_a: &[usize], _coordinates_b: &[usize], _rng: Option<&mut StdRng> ) -> Vec<i32>

Specific for some toologies, but must be checkable for anyone

fn is_direction_change( &self, _router_index: usize, _input_port: usize, _output_port: usize ) -> bool

Specific for some toologies, but must be checkable for anyone Indicates if going from input_port to output_port implies a direction change. Used for the bubble routing.

fn num_routers(&self) -> usize

fn num_servers(&self) -> usize

fn maximum_degree(&self) -> usize

fn minimum_degree(&self) -> usize

fn ports(&self, router_index: usize) -> usize

fn up_down_distance( &self, _origin: usize, _destination: usize ) -> Option<(usize, usize)>

For topologies containing the so called up/down paths. Other topologies should return always None. If the return is Some((u,d)) it means there is an initial up sub-path of length u followed by a down sub-path of length d starting at origin and ending at destination. A return value of None means there is no up/down path from origin to destination. Some general guidelines, although it is not clear if they must hold always:

fn neighbour_router_iter<'a>( &'a self, router_index: usize ) -> Box<dyn Iterator<Item = NeighbourRouterIteratorItem> + 'a>

Iterate over the neighbour routers, skipping non-connected ports and ports towards servers. You may want to reimplement this when implementing the trait for your type.

fn dragonfly_size(&self) -> Option<ArrangementSize>

Information for Dragonfly-like networks.

fn bfs(&self, origin: usize, class_weight: Option<&[usize]>) -> Vec<usize>

Breadth First Search to compute distances from a router to all others. It may use weights, but it there are multiple paths with different distances it may give a non-minimal distance, since it is not Dijkstra.

fn compute_distance_matrix( &self, class_weight: Option<&[usize]> ) -> Matrix<usize>

fn floyd(&self) -> Matrix<usize>

fn compute_amount_shortest_paths(&self) -> (Matrix<usize>, Matrix<usize>)

Return a pair of matrices (D,A) with D[i,j] being the distance from i to j and A[i,j] being the number of paths of length D[i,j] from i to j.

fn components(&self, allowed_classes: &[bool]) -> Vec<Vec<usize>>

Find the components of the subtopology induced via the allowed links. Returns vector ret with ret[k] containing the vertices in the k-th component.

fn compute_near_far_matrices(&self) -> (Matrix<usize>, Matrix<usize>)

returns a couple matrices (N,F) with N[u,v] = number of neighbours w of v with D(u,v)>D(u,w). F[u,v] = number of neighbours w of v with D(u,v)<D(u,w). A router v with F[u,v]=0 is called a boundary vertex of u.

fn eccentricity(&self, router_index: usize) -> usize

Computes the eccentricy of a router. That is, the greatest possible length of a shortest path from that router to any other.

fn check_adjacency_consistency(&self, amount_link_classes: Option<usize>)

Check pairs (port,vc) with

fn write_adjacencies_to_file( &self, file: &mut File, _format: usize ) -> Result<(), Error>

Dump the adjacencies into a file. You may use NeighboursLists::file_adj to load them.