Java tutorial
/* * Copyright (c) 2012 Stefan Wolf * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ package hudson.plugins.depgraph_view.model.graph; import com.google.common.collect.ImmutableSet; /** * Representation of an edge in the DependencyGraph */ public abstract class Edge { public final ProjectNode source; public final ProjectNode target; public Edge(ProjectNode source, ProjectNode target) { this.source = source; this.target = target; } public ImmutableSet<ProjectNode> getNodes() { return ImmutableSet.of(source, target); } public abstract String getType(); public String getColor() { return "black"; } @Override public boolean equals(Object o) { if (this == o) return true; if (o == null || getClass() != o.getClass()) return false; Edge edge = (Edge) o; if (!source.equals(edge.source)) return false; if (!target.equals(edge.target)) return false; return true; } @Override public int hashCode() { int result = source.hashCode(); result = 31 * result + target.hashCode(); return result; } }