# Conservative weighting

Given a directed graph D=(V,A), a weighting $w:A \to {\mathbb R}$ is conservative if the weight of every directed cycle is non-negative. In an undirected graph G=(V,E), a weighting $w:E \to {\mathbb R}$ is called conservative if the weight of every cycle is non-negative.