Class EWGraph

src/graph/mst/ew_graph.rs:19–23

The EWGraph class represents an edge-weighted graph of vertices named 0 through V – 1, where each undirected edge is of type Edge and has a real-valued weight. It supports the following two primary operations: add an edge to the graph, iterate over all of the edges incident to a vertex. It also provides methods for returning the degree of a vertex, the number of vertices V in the graph, and the nu

/// adjacency list of v twice and contributes two to the degree
/// of v.
pub struct EWGraph {
    nv: usize,
    ne: usize,
    adj: Vec<LinkedList<Edge>>,
}

impl IEWGraph for EWGraph {
    fn V(&self) -> usize {