ai.grakn.graql.internal.gremlin.spanningtree.ExclusiveEdge.java Source code

Introduction

Here is the source code for ai.grakn.graql.internal.gremlin.spanningtree.ExclusiveEdge.java

Source

/*
 * Grakn - A Distributed Semantic Database
 * Copyright (C) 2016  Grakn Labs Limited
 *
 * Grakn is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Grakn is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Grakn. If not, see <http://www.gnu.org/licenses/gpl.txt>.
 */

package ai.grakn.graql.internal.gremlin.spanningtree;

import ai.grakn.graql.internal.gremlin.spanningtree.graph.DirectedEdge;
import com.google.common.collect.ImmutableList;

import java.util.List;

/**
 * An edge, together with a list of edges that can't be in the final answer if 'edge' is.
 *
 * @param <V> nodes
 * @author Jason Liu
 * @author sthomson@cs.cmu.edu
 */
public class ExclusiveEdge<V> implements Comparable<ExclusiveEdge<V>> {
    public final DirectedEdge<V> edge;
    public final List<DirectedEdge<V>> excluded;
    public final double weight;

    private ExclusiveEdge(DirectedEdge<V> edge, List<DirectedEdge<V>> excluded, double weight) {
        this.edge = edge;
        this.excluded = excluded;
        this.weight = weight;
    }

    public static <T> ExclusiveEdge<T> of(DirectedEdge<T> edge, List<DirectedEdge<T>> excluded, double weight) {
        return new ExclusiveEdge<>(edge, excluded, weight);
    }

    public static <T> ExclusiveEdge<T> of(DirectedEdge<T> edge, double weight) {
        return ExclusiveEdge.of(edge, ImmutableList.of(), weight);
    }

    @Override
    public int compareTo(ExclusiveEdge<V> exclusiveEdge) {
        return Double.compare(weight, exclusiveEdge.weight);
    }

    @Override
    public boolean equals(Object o) {
        if (this == o)
            return true;
        if (o == null || getClass() != o.getClass())
            return false;

        final ExclusiveEdge that = (ExclusiveEdge) o;
        return edge != null && edge.equals(that.edge) && excluded != null && excluded.equals(that.excluded)
                && Double.compare(weight, that.weight) == 0;
    }

    @Override
    public int hashCode() {
        int result = edge != null ? edge.hashCode() : 0;
        result = result * 31 + (excluded != null ? excluded.hashCode() : 0);
        result = result * 31 + Double.valueOf(weight).hashCode();
        return result;
    }
}