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

com.google.common.graph.AbstractValueGraph Maven / Gradle / Ivy

Go to download

This artifact provides a single jar that contains all classes required to use remote EJB and JMS, including all dependencies. It is intended for use by those not using maven, maven users should just import the EJB and JMS BOM's instead (shaded JAR's cause lots of problems with maven, as it is very easy to inadvertently end up with different versions on classes on the class path).

There is a newer version: 34.0.0.Final
Show newest version
/*
 * Copyright (C) 2016 The Guava Authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.graph;

import static java.util.Objects.requireNonNull;

import com.google.common.annotations.Beta;
import com.google.common.collect.Maps;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
import javax.annotation.CheckForNull;

/**
 * This class provides a skeletal implementation of {@link ValueGraph}. It is recommended to extend
 * this class rather than implement {@link ValueGraph} directly.
 *
 * 

The methods implemented in this class should not be overridden unless the subclass admits a * more efficient implementation. * * @author James Sexton * @param Node parameter type * @param Value parameter type * @since 20.0 */ @Beta @ElementTypesAreNonnullByDefault public abstract class AbstractValueGraph extends AbstractBaseGraph implements ValueGraph { @Override public Graph asGraph() { return new AbstractGraph() { @Override public Set nodes() { return AbstractValueGraph.this.nodes(); } @Override public Set> edges() { return AbstractValueGraph.this.edges(); } @Override public boolean isDirected() { return AbstractValueGraph.this.isDirected(); } @Override public boolean allowsSelfLoops() { return AbstractValueGraph.this.allowsSelfLoops(); } @Override public ElementOrder nodeOrder() { return AbstractValueGraph.this.nodeOrder(); } @Override public ElementOrder incidentEdgeOrder() { return AbstractValueGraph.this.incidentEdgeOrder(); } @Override public Set adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set successors(N node) { return AbstractValueGraph.this.successors(node); } @Override public int degree(N node) { return AbstractValueGraph.this.degree(node); } @Override public int inDegree(N node) { return AbstractValueGraph.this.inDegree(node); } @Override public int outDegree(N node) { return AbstractValueGraph.this.outDegree(node); } }; } @Override public Optional edgeValue(N nodeU, N nodeV) { return Optional.ofNullable(edgeValueOrDefault(nodeU, nodeV, null)); } @Override public Optional edgeValue(EndpointPair endpoints) { return Optional.ofNullable(edgeValueOrDefault(endpoints, null)); } @Override public final boolean equals(@CheckForNull Object obj) { if (obj == this) { return true; } if (!(obj instanceof ValueGraph)) { return false; } ValueGraph other = (ValueGraph) obj; return isDirected() == other.isDirected() && nodes().equals(other.nodes()) && edgeValueMap(this).equals(edgeValueMap(other)); } @Override public final int hashCode() { return edgeValueMap(this).hashCode(); } /** Returns a string representation of this graph. */ @Override public String toString() { return "isDirected: " + isDirected() + ", allowsSelfLoops: " + allowsSelfLoops() + ", nodes: " + nodes() + ", edges: " + edgeValueMap(this); } private static Map, V> edgeValueMap(final ValueGraph graph) { return Maps.asMap( graph.edges(), edge -> // requireNonNull is safe because the endpoint pair comes from the graph. requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null))); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy