C# QuikGraph按图表排序元素

using QuikGraph;
using System;
using System.Linq;

class Program
{
    static void Main()
    {
        var graph = new BidirectionalGraph<int, Edge<int>>();

        // 添加顶点和边
        graph.AddVertex(1);
        graph.AddVertex(2);
        graph.AddVertex(3);
        graph.AddEdge(new Edge<int>(1, 2));
        graph.AddEdge(new Edge<int>(2, 3));
        graph.AddEdge(new Edge<int>(3, 1));

        // 按顶点度数排序
        var sortedVertices = graph.Vertices.OrderBy(v => graph.Degree(v)).ToList();

        foreach (var vertex in sortedVertices)
        {
            Console.WriteLine($"Vertex {vertex} has degree {graph.Degree(vertex)}");
        }
    }
}

using QuikGraph;
using System;
using System.Linq;

class Program
{
    static void Main()
    {
        var graph = new WeightedBidirectionalGraph<int, Edge<int>>();

        // 添加顶点和边
        graph.AddVertex(1);
        graph.AddVertex(2);
        graph.AddVertex(3);
        var edge1 = new Edge<int>(1, 2);
        var edge2 = new Edge<int>(2, 3);
        var edge3 = new Edge<int>(3, 1);
        graph.AddEdge(edge1, 5);
        graph.AddEdge(edge2, 3);
        graph.AddEdge(edge3, 7);

        // 按边的权重排序
        var sortedEdges = graph.Edges.OrderBy(e => graph.GetEdgeWeight(e)).ToList();

        foreach (var edge in sortedEdges)
        {
            Console.WriteLine($"Edge {edge} has weight {graph.GetEdgeWeight(edge)}");
        }
    }
}

foreach (var vertex in graph.Vertices)
{
    Console.WriteLine($"Vertex {vertex} has degree {graph.Degree(vertex)}");
}

foreach (var edge in graph.Edges)
{
    Console.WriteLine($"Edge {edge} with weight {graph.GetEdgeWeight(edge)}");
}