Routing Algorithms that compute the least-cost path between a source and destination using complete global knowledge of the network. That is it know all nodes, edges and edge costs.
These are also called link-state (LS) algorithms as they know the cost of each Link in the network.