package de.ellpeck.prettypipes.network; import com.google.common.collect.Sets; import de.ellpeck.prettypipes.Registry; import de.ellpeck.prettypipes.Utility; import de.ellpeck.prettypipes.blocks.pipe.PipeBlock; import de.ellpeck.prettypipes.blocks.pipe.PipeTileEntity; import net.minecraft.block.Block; import net.minecraft.block.BlockState; import net.minecraft.nbt.CompoundNBT; import net.minecraft.nbt.ListNBT; import net.minecraft.nbt.NBTUtil; import net.minecraft.util.Direction; import net.minecraft.util.Tuple; import net.minecraft.util.math.BlockPos; import net.minecraft.world.World; import net.minecraftforge.common.capabilities.Capability; import net.minecraftforge.common.capabilities.ICapabilitySerializable; import net.minecraftforge.common.util.Constants; import net.minecraftforge.common.util.LazyOptional; import org.jgrapht.alg.shortestpath.DijkstraShortestPath; import org.jgrapht.graph.SimpleWeightedGraph; import javax.annotation.Nonnull; import javax.annotation.Nullable; import java.util.ArrayList; import java.util.List; public class PipeNetwork implements ICapabilitySerializable { public final SimpleWeightedGraph graph = new SimpleWeightedGraph<>(NetworkEdge.class); private final DijkstraShortestPath dijkstra = new DijkstraShortestPath<>(this.graph); private final World world; public PipeNetwork(World world) { this.world = world; } @Nonnull @Override public LazyOptional getCapability(@Nonnull Capability cap, @Nullable Direction side) { return cap == Registry.pipeNetworkCapability ? LazyOptional.of(() -> (T) this) : null; } @Override public CompoundNBT serializeNBT() { CompoundNBT nbt = new CompoundNBT(); ListNBT nodes = new ListNBT(); for (BlockPos node : this.graph.vertexSet()) nodes.add(NBTUtil.writeBlockPos(node)); nbt.put("nodes", nodes); ListNBT edges = new ListNBT(); for (NetworkEdge edge : this.graph.edgeSet()) edges.add(edge.serializeNBT()); nbt.put("edges", edges); return nbt; } @Override public void deserializeNBT(CompoundNBT nbt) { this.graph.removeAllVertices(new ArrayList<>(this.graph.vertexSet())); ListNBT nodes = nbt.getList("nodes", Constants.NBT.TAG_COMPOUND); for (int i = 0; i < nodes.size(); i++) this.graph.addVertex(NBTUtil.readBlockPos(nodes.getCompound(i))); ListNBT edges = nbt.getList("edges", Constants.NBT.TAG_COMPOUND); for (int i = 0; i < edges.size(); i++) { NetworkEdge edge = new NetworkEdge(this.world); edge.deserializeNBT(edges.getCompound(i)); this.addEdge(edge); } } public void addNode(BlockPos pos, BlockState state) { if (!this.graph.containsVertex(pos)) { this.graph.addVertex(pos); this.refreshNode(pos, state); } } public void removeNode(BlockPos pos) { if (this.graph.containsVertex(pos)) this.graph.removeVertex(pos); } public void onPipeChanged(BlockPos pos, BlockState state) { List neighbors = this.createAllEdges(pos, state, true); // if we only have one neighbor, then there can't be any new connections if (neighbors.size() <= 1 && !this.graph.containsVertex(pos)) return; for (NetworkEdge edge : neighbors) this.refreshNode(edge.endPipe, this.world.getBlockState(edge.endPipe)); } private void refreshNode(BlockPos pos, BlockState state) { this.graph.removeAllEdges(new ArrayList<>(this.graph.edgesOf(pos))); for (NetworkEdge edge : this.createAllEdges(pos, state, false)) this.addEdge(edge); } private void addEdge(NetworkEdge edge) { this.graph.addEdge(edge.startPipe, edge.endPipe, edge); this.graph.setEdgeWeight(edge, edge.pipes.size()); } private List createAllEdges(BlockPos pos, BlockState state, boolean allAround) { List edges = new ArrayList<>(); for (Direction dir : Direction.values()) { NetworkEdge edge = this.createEdge(pos, state, dir, allAround); if (edge != null) edges.add(edge); } return edges; } private NetworkEdge createEdge(BlockPos pos, BlockState state, Direction dir, boolean allAround) { if (!allAround && !state.get(PipeBlock.DIRECTIONS.get(dir)).isConnected()) return null; BlockPos currPos = pos.offset(dir); BlockState currState = this.world.getBlockState(currPos); if (!(currState.getBlock() instanceof PipeBlock)) return null; NetworkEdge edge = new NetworkEdge(this.world); edge.startPipe = pos; edge.pipes.add(pos); edge.pipes.add(currPos); while (true) { // if we found a vertex, we can stop since that's the next node // we do this here since the first offset pipe also needs to check this if (this.graph.containsVertex(currPos)) { edge.endPipe = edge.pipes.get(edge.pipes.size() - 1); return edge; } boolean found = false; for (Direction nextDir : Direction.values()) { if (!currState.get(PipeBlock.DIRECTIONS.get(nextDir)).isConnected()) continue; BlockPos offset = currPos.offset(nextDir); BlockState offState = this.world.getBlockState(offset); if (!(offState.getBlock() instanceof PipeBlock)) continue; if (edge.pipes.contains(offset)) continue; edge.pipes.add(offset); currPos = offset; currState = offState; found = true; break; } if (!found) break; } return null; } public static PipeNetwork get(World world) { return world.getCapability(Registry.pipeNetworkCapability).orElse(null); } }