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

org.jgrapht.graph.AsUnweightedDirectedGraph Maven / Gradle / Ivy

/* ==========================================
 * JGraphT : a free Java graph-theory library
 * ==========================================
 *
 * Project Info:  http://jgrapht.sourceforge.net/
 * Project Creator:  Barak Naveh (http://sourceforge.net/users/barak_naveh)
 *
 * (C) Copyright 2003-2008, by Barak Naveh and Contributors.
 *
 * 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.
 */
/*  ----------------------
 * AsUnweightedGraph.java
 * ----------------------
 * (C) Copyright 2007-2008, by Lucas J. Scharenbroich and Contributors.
 *
 * Original Author:  Lucas J. Scharenbroich
 * Contributor(s):   John V. Sichi
 *
 * $Id$
 *
 * Changes
 * -------
 * 7-Sep-2007 : Initial revision (LJS);
 *
 */
package org.jgrapht.graph;

import java.io.*;

import org.jgrapht.*;


/**
 * An unweighted view of the backing weighted graph specified in the
 * constructor. This graph allows modules to apply algorithms designed for
 * unweighted graphs to a weighted graph by simply ignoring edge weights. Query
 * operations on this graph "read through" to the backing graph. Vertex
 * addition/removal and edge addition/removal are all supported (and immediately
 * reflected in the backing graph).
 *
 * 

Note that edges returned by this graph's accessors are really just the * edges of the underlying directed graph.

* *

This graph does not pass the hashCode and equals operations through * to the backing graph, but relies on Object's equals and * hashCode methods. This graph will be serializable if the backing * graph is serializable.

* * @author Lucas J. Scharenbroich * @since Sep 7, 2007 */ public class AsUnweightedDirectedGraph extends GraphDelegator implements Serializable, DirectedGraph { /** */ private static final long serialVersionUID = -4320818446777715312L; /** * Constructor for AsUnweightedGraph. * * @param g the backing graph over which an unweighted view is to be * created. */ public AsUnweightedDirectedGraph(DirectedGraph g) { super(g); } /** * @see Graph#getEdgeWeight */ @Override public double getEdgeWeight(E e) { if (e == null) { throw new NullPointerException(); } else { return WeightedGraph.DEFAULT_EDGE_WEIGHT; } } } // End AsUnweightedDirectedGraph.java




© 2015 - 2024 Weber Informatics LLC | Privacy Policy