All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.salesforce.jgrapht.graph.specifics.UndirectedEdgeContainer Maven / Gradle / Ivy

Go to download

This project contains the apt processor that implements all the checks enumerated in @Verify. It is a self contained, and shaded jar.

There is a newer version: 2.0.7
Show newest version
/*
 * (C) Copyright 2015-2017, by Barak Naveh and Contributors.
 *
 * JGraphT : a free Java graph-theory library
 *
 * This program and the accompanying materials are dual-licensed under
 * either
 *
 * (a) the terms of the GNU Lesser General Public License version 2.1
 * as published by the Free Software Foundation, or (at your option) any
 * later version.
 *
 * or (per the licensee's choosing)
 *
 * (b) the terms of the Eclipse Public License v1.0 as published by
 * the Eclipse Foundation.
 */
package com.salesforce.jgrapht.graph.specifics;

import java.io.*;
import java.util.*;

import com.salesforce.jgrapht.graph.*;

/**
 * A container for vertex edges.
 *
 * 

* In this edge container we use array lists to minimize memory toll. However, for high-degree * vertices we replace the entire edge container with a direct access subclass (to be implemented). *

* * @param the graph vertex type * @param the graph edge type * * @author Barak Naveh */ public class UndirectedEdgeContainer implements Serializable { private static final long serialVersionUID = -6623207588411170010L; Set vertexEdges; private transient Set unmodifiableVertexEdges = null; UndirectedEdgeContainer(EdgeSetFactory edgeSetFactory, V vertex) { vertexEdges = edgeSetFactory.createEdgeSet(vertex); } /** * A lazy build of unmodifiable list of vertex edges * * @return an unmodifiable set of vertex edges */ public Set getUnmodifiableVertexEdges() { if (unmodifiableVertexEdges == null) { unmodifiableVertexEdges = Collections.unmodifiableSet(vertexEdges); } return unmodifiableVertexEdges; } /** * Add a vertex edge * * @param e the edge to add */ public void addEdge(E e) { vertexEdges.add(e); } /** * Get number of vertex edges * * @return the number of vertex edges */ public int edgeCount() { return vertexEdges.size(); } /** * Remove a vertex edge * * @param e the edge to remove */ public void removeEdge(E e) { vertexEdges.remove(e); } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy