In this paper, a novel approach to Mathematical Morphology operations is proposed. Morphological operators based on partial differential equations (PDEs) are extended to weighted graphs of the arbitrary topologies by considering partial difference equations. We focus on a general class of morphological filters, the levelings; and propose a novel approach of such filters. Indeed, our methodology recovers classical local PDEs-based levelings in image processing, generalizes them to nonlocal configurations and extends them to process any discrete data that can be represented by a graph. Experimental results show applications and the potential of our levelings to textured image processing, region adjacency graph based multiscale leveling and unorganized data set filtering.