There are many different mathematical objects (transitive reductions, minimal equivalent digraphs, minimal connected graphs, Hasse diagrams and so on) that are defined on graphs. Although they have different names they correspond to the same object if a weighted graph is defined more generally. The study of such generally defined graphs allows to consider some common properties of the objects, which seem different at the first glance.
This article presents a new kind of weighted graphs when the weights of the edges belong to a partially ordered set L. The case, when L is a positive linearly ordered monoid, is considered in more detail. For such L, the weight of a path is equal to the product of the weights of its edges. The exact lower bound of the weights of all paths between two vertices is the distance between these vertices. Graphs with the same set of vertices and equal distance for every pair of vertices form an equivalence class. One can define an order on the set of graphs in the natural way. It is shown that any equivalence class has a smallest element and a non-empty set of maximal elements, the bases. An algorithm is given to find a basis. When an equivalence class has only one basis is also shown.