Skip to main content
Fig. 2 | Energy Informatics

Fig. 2

From: Solar farm cable layout optimization as a graph problem

Fig. 2

A toy example of a solar farm, in which all vertex capacities are sufficient but their interaction implies infeasibility. Due to 30 strings, each inverter needs an inflow of 10 and each transformer an inflow of 15. But with only one outgoing edge per vertex allowed, inverters and transformers cannot be connected

Back to article page