computeDistanceVectorRoutes<T> function

DistanceVectorRoutingTable<T> computeDistanceVectorRoutes<T>(
  1. Map<T, Map<T, num>> network,
  2. T sourceNode, {
  3. Map<T, NeighborAdvertisement<T>>? initialAdvertisements,
})

Convenience function for quick distance-vector route computation

network - Network topology as adjacency list sourceNode - Source node for routing table initialAdvertisements - Optional initial neighbor advertisements

Returns complete distance-vector routing table from source node

Throws ArgumentError if source node doesn't exist in network

Implementation

DistanceVectorRoutingTable<T> computeDistanceVectorRoutes<T>(
  Map<T, Map<T, num>> network,
  T sourceNode, {
  Map<T, NeighborAdvertisement<T>>? initialAdvertisements,
}) {
  return DistanceVectorRoutingAlgorithm<T>().computeRoutes(
    network,
    sourceNode,
    initialAdvertisements: initialAdvertisements,
  );
}