org.jgrapht.graph.UndirectedGraphUnion Maven / Gradle / Ivy
/*
* (C) Copyright 2009-2016, by Ilya Razenshteyn 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 org.jgrapht.graph;
import java.util.*;
import org.jgrapht.*;
import org.jgrapht.util.*;
/**
* An undirected version of the read-only union of two graphs.
*
* @param the graph vertex type
* @param the graph edge type
*/
public class UndirectedGraphUnion
extends GraphUnion>
implements UndirectedGraph
{
private static final long serialVersionUID = -740199233080172450L;
UndirectedGraphUnion(
UndirectedGraph g1, UndirectedGraph g2, WeightCombiner operator)
{
super(g1, g2, operator);
}
UndirectedGraphUnion(UndirectedGraph g1, UndirectedGraph g2)
{
super(g1, g2);
}
@Deprecated
UndirectedGraphUnion(
UndirectedGraph g1, UndirectedGraphUnion g2, WeightCombiner operator)
{
super(g1, g2, operator);
}
@Deprecated
UndirectedGraphUnion(UndirectedGraph g1, UndirectedGraphUnion g2)
{
super(g1, g2);
}
@Override
public int degreeOf(V vertex)
{
Set res = edgesOf(vertex);
return res.size();
}
}
// End UndirectedGraphUnion.java
© 2015 - 2025 Weber Informatics LLC | Privacy Policy