package edu.princeton.cs.algs4.ch42;
import edu.princeton.cs.introcs.*;
/*************************************************************************
* Compilation: javac DirectedEdge.java
* Execution: java DirectedEdge
*
* Immutable weighted directed edge.
*
*************************************************************************/
/**
* The <tt>DirectedEdge</tt> class represents a weighted edge in an
* {@link edu.princeton.cs.algs4.ch43.EdgeWeightedDigraph}. Each edge consists of two integers
* (naming the two vertices) and a real-value weight. The data type
* provides methods for accessing the two endpoints of the directed edge and
* the weight.
* <p>
* For additional documentation, see <a href="http://algs4.cs.princeton.edu/44sp">Section 4.4</a> of
* <i>Algorithms, 4th Edition</i> by Robert Sedgewick and Kevin Wayne.
*
* @author Robert Sedgewick
* @author Kevin Wayne
*/
public class DirectedEdge {
private final int v;
private final int w;
private final double weight;
/**
* Initializes a directed edge from vertex <tt>v</tt> to vertex <tt>w</tt> with
* the given <tt>weight</tt>.
* @param v the tail vertex
* @param w the head vertex
* @param weight the weight of the directed edge
* @throws java.lang.IndexOutOfBoundsException if either <tt>v</tt> or <tt>w</tt>
* is a negative integer
* @throws IllegalArgumentException if <tt>weight</tt> is <tt>NaN</tt>
*/
public DirectedEdge(int v, int w, double weight) {
if (v < 0) throw new IndexOutOfBoundsException("Vertex names must be nonnegative integers");
if (w < 0) throw new IndexOutOfBoundsException("Vertex names must be nonnegative integers");
if (Double.isNaN(weight)) throw new IllegalArgumentException("Weight is NaN");
this.v = v;
this.w = w;
this.weight = weight;
}
/**
* Returns the tail vertex of the directed edge.
* @return the tail vertex of the directed edge
*/
public int from() {
return v;
}
/**
* Returns the head vertex of the directed edge.
* @return the head vertex of the directed edge
*/
public int to() {
return w;
}
/**
* Returns the weight of the directed edge.
* @return the weight of the directed edge
*/
public double weight() {
return weight;
}
/**
* Returns a string representation of the directed edge.
* @return a string representation of the directed edge
*/
public String toString() {
return v + "->" + w + " " + String.format("%5.2f", weight);
}
/**
* Unit tests the <tt>DirectedEdge</tt> data type.
*/
public static void main(String[] args) {
DirectedEdge e = new DirectedEdge(12, 23, 3.14);
StdOut.println(e);
}
}
/*************************************************************************
* Copyright 2002-2012, Robert Sedgewick and Kevin Wayne.
*
* This file is part of algs4-package.jar, which accompanies the textbook
*
* Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne,
* Addison-Wesley Professional, 2011, ISBN 0-321-57351-X.
* http://algs4.cs.princeton.edu
*
*
* algs4-package.jar 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.
*
* algs4-package.jar 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 algs4-package.jar. If not, see http://www.gnu.org/licenses.
*************************************************************************/