Do all consensus algorithms aim to solve the Byzantine generals problem? Can I clarify my understanding:

Byzantine Fault Tolerance is a characteristic of a system to tolerate a class of failures belonging to the byzantine generals problem.

Byzantine Fault tolerance is also the name of the consensus algorithm that solves the byzantine generals problem?

I see Ripple as being BFT. Does it mean it uses some custom algorithm, that solves BFT?

I also see Stellar uses BFT, does this mean that Stellar and Ripple Both use different algorithms that solve BFT?

Edit:

Can all Proof of Insert word algorithms be seen to be a part of BFT? Because POW uses a probabilistic model to solve the generals problem, but it is not seen as BFT.
To answer your question, no.

BFT-class consensus algorithms seek to solve the Byzantine Generals Problem.

Other consensus algorithms, generally the Nakamato-style consensus algorithms) including PoW (Proof-of-Work, used by Bitcoin) and PoET (Proof of Elapsed Time, used by Sawtooth) do not seek to solve BFT.