Method Load

src/saveload/linkgraph_sl.cpp:52–93

	}

	void Load(Node *bn) const override
	{
		if (IsSavegameVersionBefore(SLV_LINKGRAPH_EDGES)) {
			uint16_t max_size = _linkgraph->Size();
			std::vector<Edge> edges(max_size);

			if (IsSavegameVersionBefore(SLV_191)) {
				/* We used to save the full matrix ... */
				for (NodeID to = 0; to < max_size; ++to) {
					SlObject(&edges[to], this->GetLoadDescription());
				}
			} else {
				size_t used_size = IsSavegameVersionBefore(SLV_SAVELOAD_LIST_LENGTH) ? max_size : SlGetStructListLength(UINT16_MAX);

				/* ... but as that wasted a lot of space we save a sparse matrix now. */
				for (NodeID to = _linkgraph_from; to != INVALID_NODE; to = edges[to].dest_node) {
					if (used_size == 0) SlErrorCorrupt("Link graph structure overflow");
					used_size--;

					if (to >= max_size) SlErrorCorrupt("Link graph structure overflow");
					SlObject(&edges[to], this->GetLoadDescription());
				}

				if (!IsSavegameVersionBefore(SLV_SAVELOAD_LIST_LENGTH) && used_size > 0) SlErrorCorrupt("Corrupted link graph");
			}

			/* Build edge list from edge matrix. */
			for (NodeID to = edges[_linkgraph_from].dest_node; to != INVALID_NODE; to = edges[to].dest_node) {
				auto &edge = bn->edges.emplace_back(edges[to]);
				edge.dest_node = to;
			}
			/* Sort by destination. */
			std::sort(bn->edges.begin(), bn->edges.end());
		} else {
			/* Edge data is now a simple vector and not any kind of matrix. */
			size_t size = SlGetStructListLength(UINT16_MAX);
			for (size_t i = 0; i < size; i++) {
				auto &edge = bn->edges.emplace_back();
				SlObject(&edge, this->GetLoadDescription());
			}
		}
	}
};

class SlLinkgraphNode : public DefaultSaveLoadHandler<SlLinkgraphNode, LinkGraph> {