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

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

There is a newer version: 1.5.2
Show newest version
/*
 * (C) Copyright 2003-2018, 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 org.jgrapht.graph;

/**
 * A weighted variant of the intrusive edges specifics.
 * 
 * 

* The implementation optimizes the use of {@link DefaultWeightedEdge} and subclasses. For other * custom user edge types, a map is used to store vertex source, target and weight. * * @author Barak Naveh * @author Dimitrios Michail * * @param the graph vertex type * @param the graph edge type */ public class WeightedIntrusiveEdgesSpecifics extends BaseIntrusiveEdgesSpecifics implements IntrusiveEdgesSpecifics { private static final long serialVersionUID = 5327226615635500554L; /** * Constructor */ public WeightedIntrusiveEdgesSpecifics() { super(); } @Override public boolean add(E e, V sourceVertex, V targetVertex) { IntrusiveWeightedEdge intrusiveEdge; if (e instanceof IntrusiveWeightedEdge) { intrusiveEdge = (IntrusiveWeightedEdge) e; } else { intrusiveEdge = new IntrusiveWeightedEdge(); } intrusiveEdge.source = sourceVertex; intrusiveEdge.target = targetVertex; return edgeMap.putIfAbsent(e, intrusiveEdge) == null; } @Override public double getEdgeWeight(E e) { IntrusiveWeightedEdge ie = getIntrusiveEdge(e); if (ie == null) { throw new IllegalArgumentException("no such edge in graph: " + e.toString()); } return ie.weight; } @Override public void setEdgeWeight(E e, double weight) { IntrusiveWeightedEdge ie = getIntrusiveEdge(e); if (ie == null) { throw new IllegalArgumentException("no such edge in graph: " + e.toString()); } ie.weight = weight; } @Override protected IntrusiveWeightedEdge getIntrusiveEdge(E e) { if (e instanceof IntrusiveWeightedEdge) { return (IntrusiveWeightedEdge) e; } return edgeMap.get(e); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy