Category
page 1Routing algorithms
Dijkstra's algorithm
graph search algorithm
A* search algorithm
algorithm used for pathfinding and graph traversal
Floyd–Warshall algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
pathfinding
thumb|upright=1.2|Equivalent paths between A and B in a 2D environment
distance-vector routing protocol
class of routing protocols
Optimized Link State Routing Protocol
IP routing protocol optimized for mobile ad hoc networks
link-state routing protocol
class of routing protocols
Simplified Memory-Bounded A*
SMA* or Simplified Memory Bounded A* is a shortest path algorithm based on the A* algorithm. The main advantage of SMA* is that it uses a bounded memory, while the A* algorithm might need exponential memory. All other characteristics of SMA* are inherited from A*.
Equal-cost multi-path routing
packet routing strategy
Gossip protocol
concept in computing
iterative deepening A*
heuristic pathfinding algorithm
source routing
Babel
routing protocol
flooding
simple routing algorithm sending incoming packets to all other links than the sender
diffusing update algorithm
algorithm
B*
In computer science, B* (pronounced "B star") is a best-first graph search algorithm that finds the least-cost path from a given initial node to any goal node (out of one or more possible goals). First published by Hans Berliner in 1979, it is related to the A* search algorithm.