Weighted Directed Graph

Definition ∞ A weighted directed graph is a mathematical structure consisting of a set of nodes connected by edges, where each edge has a direction and an associated numerical weight. The direction indicates a one-way relationship, and the weight quantifies the strength, cost, or capacity of that relationship. These graphs are used to model complex networks and flows.
Context ∞ Weighted directed graphs are employed in analyzing transaction flows, network influence, or economic relationships within digital asset ecosystems. News reports might use such graph analysis to understand the propagation of value, identify central entities, or assess the interconnectedness of various decentralized finance protocols. Their application provides a powerful tool for visualizing and understanding the structure of blockchain networks.