This chapter provides a review of distributed algorithms to be used in weighted graphs. Finding the minimum spanning tree is a fundamental problem in such graphs. Another main problem is finding shortest paths between the nodes of the graph when the graphWeighted graphs is used to represent a computer network. Matching in a weighted graph aims to find a total maximum weight of non-adjacent edges. We describe distributed algorithms for minimum spanning trees, routing and weighted matching and their implementations in Python in this chapter.