Weighted bipartite matching asks for a matching with maximum total weight (sum of edge weights). This is harder than unweighted matching and requires the Hungarian algorithm or min-cost max-flow. The Hungarian algorithm runs in for dense graphs.
It uses alternating paths but also adjusts vertex potentials to find augmenting paths with maximum weight increase. This is used in assignment problems with costs.
Space complexity is for the data structures used.