JGraphT中压缩图的算法（删除某些边和顶点）

可以通过遍历图来删除指定的边和顶点来压缩JGraphT图。以下是Java代码示例：

import org.jgrapht.Graph;
import org.jgrapht.Graphs;
import org.jgrapht.alg.interfaces.SpanningTreeAlgorithm.SpanningTree;
import org.jgrapht.alg.spanning.PrimMinimumSpanningTree;
import org.jgrapht.graph.DefaultEdge;
import org.jgrapht.graph.SimpleDirectedWeightedGraph;
import org.jgrapht.graph.SimpleWeightedGraph;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import java.util.Random;

public class JGraphTCompression {

    public static void main(String[] args) {
        SimpleWeightedGraph<Integer, DefaultEdge> graph = new SimpleWeightedGraph<>(DefaultEdge.class);

        for (int i = 0; i < 10; i++) {
            graph.addVertex(i);
        }

        Random rand = new Random();

        for (int i = 0; i < 15; i++) {
            int v1 = rand.nextInt(10);
            int v2 = rand.nextInt(10);
            if (v1 != v2 && !graph.containsEdge(v1, v2)) {
                graph.addEdge(v1, v2);
                graph.setEdgeWeight(graph.getEdge(v1, v2), rand.nextInt(10));
            } else {
                i--;
            }
        }

        System.out.println("Original graph:\n" + graph.toString() + "\n");

        List<Integer> verticesToDelete = new ArrayList<>();
        verticesToDelete.add(1);
        verticesToDelete.add(3);

        List<DefaultEdge> edgesToDelete = new ArrayList<>();
        edgesToDelete.add(graph.getEdge(0, 5));
        edgesToDelete.add(graph.getEdge(2, 4));

        compressGraph(graph, verticesToDelete, edgesToDelete);
        System.out.println("Compressed graph:\n" + graph.toString());
    }

    public static void compressGraph(Graph<Integer, DefaultEdge> graph, List<Integer> verticesToDelete, List<DefaultEdge> edgesToDelete) {
        graph.removeAllVertices(verticesToDelete);
        graph.removeAllEdges(edgesToDelete);
    }
}

该代码实现了以下步骤：

1. 创建一个带有10个顶点和15个随机加权边的无向图。
2. 解压缩指定顶点和边的图形。
3. 打印出原始和压缩后的图形。

在这种情况下，图形被压缩，删除了顶点1和3