| Line | Hits | Source |
|---|---|---|
| 1 | /* | |
| 2 | * Copyright (c) 2003, the JUNG Project and the Regents of the University | |
| 3 | * of California | |
| 4 | * All rights reserved. | |
| 5 | * | |
| 6 | * This software is open-source under the BSD license; see either | |
| 7 | * "license.txt" or | |
| 8 | * http://jung.sourceforge.net/license.txt for a description. | |
| 9 | */ | |
| 10 | package edu.uci.ics.jung.graph.impl; | |
| 11 | ||
| 12 | import edu.uci.ics.jung.graph.DirectedEdge; | |
| 13 | import edu.uci.ics.jung.graph.Vertex; | |
| 14 | ||
| 15 | /** | |
| 16 | * An implementation of <code>DirectedEdge</code> that resides in a | |
| 17 | * directed graph. | |
| 18 | * | |
| 19 | * @author Scott D. White | |
| 20 | * @author Joshua O'Madadhain | |
| 21 | * @author Danyel Fisher | |
| 22 | * | |
| 23 | * @see DirectedSparseVertex | |
| 24 | * @see DirectedSparseGraph | |
| 25 | */ | |
| 26 | public class DirectedSparseEdge extends AbstractSparseEdge implements DirectedEdge { | |
| 27 | ||
| 28 | /** | |
| 29 | * Creates a directed edge whose source is <code>from</code> and whose | |
| 30 | * destination is <code>to</code>. | |
| 31 | */ | |
| 32 | public DirectedSparseEdge(Vertex from, Vertex to) { | |
| 33 | 3304 | super(from, to); |
| 34 | 3299 | } |
| 35 | ||
| 36 | /** | |
| 37 | * @see DirectedEdge#getSource() | |
| 38 | */ | |
| 39 | public Vertex getSource() { | |
| 40 | 8679 | return (Vertex)getEndpoints().getFirst(); |
| 41 | } | |
| 42 | ||
| 43 | /** | |
| 44 | * @see DirectedEdge#getDest() | |
| 45 | */ | |
| 46 | public Vertex getDest() { | |
| 47 | 9744 | return (Vertex)getEndpoints().getSecond(); |
| 48 | } | |
| 49 | } |
|
this report was generated by version 1.0.5 of jcoverage. |
copyright © 2003, jcoverage ltd. all rights reserved. |