  This paper is about the combinatorics of finite point configurations in the
tropical projective space or, dually, of arrangements of finitely many tropical
hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be
considered via coarsenings of the resulting polyhedral decompositions of
$\mathbb{R}^d$. This leads to natural cell decompositions of the tropical
projective space $\mathbb{TP}_{\min}^{d-1}$. Our method is to employ a known
class of ordinary convex polyhedra naturally associated with weighted digraphs.
This way we can relate to and use results from combinatorics and optimization.
One outcome is the solution of a conjecture of Develin and Yu (2007).
