com.salesforce.jgrapht.graph.UndirectedSubgraph Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of AptSpringProcessor Show documentation

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 2003-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;

import java.util.*;

import com.salesforce.jgrapht.*;

/**
 * An undirected graph that is a subgraph of another graph.
 *
 * @param  the graph vertex type
 * @param  the graph edge type
 *
 * @see Subgraph
 */
public class UndirectedSubgraph
    extends Subgraph>
    implements UndirectedGraph
{
    private static final long serialVersionUID = 3256728359772631350L;

    /**
     * Creates a new undirected subgraph.
     *
     * @param base the base (backing) graph on which the subgraph will be based.
     * @param vertexSubset vertices to include in the subgraph. If null then all
     *        vertices are included.
     * @param edgeSubset edges to in include in the subgraph. If null then all the
     *        edges whose vertices found in the graph are included.
     */
    public UndirectedSubgraph(
        UndirectedGraph base, Set vertexSubset, Set edgeSubset)
    {
        super(base, vertexSubset, edgeSubset);
    }

    /**
     * Creates a new undirected induced subgraph.
     *
     * @param base the base (backing) graph on which the subgraph will be based.
     * @param vertexSubset vertices to include in the subgraph. If null then all
     *        vertices are included.
     */
    public UndirectedSubgraph(UndirectedGraph base, Set vertexSubset)
    {
        this(base, vertexSubset, null);
    }

    /**
     * Creates a new undirected induced subgraph with all vertices included.
     *
     * @param base the base (backing) graph on which the subgraph will be based.
     */
    public UndirectedSubgraph(UndirectedGraph base)
    {
        this(base, null, null);
    }

    /**
     * {@inheritDoc}
     */
    @Override
    public int degreeOf(V vertex)
    {
        assertVertexExist(vertex);

        int degree = 0;
        Iterator it = base.edgesOf(vertex).stream().filter(e -> edgeSet.contains(e)).iterator();
        while (it.hasNext()) {
            E e = it.next();
            degree++;
            if (getEdgeSource(e).equals(getEdgeTarget(e))) {
                degree++;
            }
        }
        return degree;
    }
}

// End UndirectedSubgraph.java