| Line | Hits | Source |
|---|---|---|
| 1 | /* | |
| 2 | * Created on Apr 28, 2005 | |
| 3 | * | |
| 4 | * Copyright (c) 2005, the JUNG Project and the Regents of the University | |
| 5 | * of California | |
| 6 | * All rights reserved. | |
| 7 | * | |
| 8 | * This software is open-source under the BSD license; see either | |
| 9 | * "license.txt" or | |
| 10 | * http://jung.sourceforge.net/license.txt for a description. | |
| 11 | */ | |
| 12 | package edu.uci.ics.jung.graph.impl; | |
| 13 | ||
| 14 | import java.util.Collection; | |
| 15 | import java.util.HashSet; | |
| 16 | import java.util.Iterator; | |
| 17 | import java.util.Set; | |
| 18 | ||
| 19 | import edu.uci.ics.jung.graph.Hyperedge; | |
| 20 | ||
| 21 | /** | |
| 22 | * | |
| 23 | * @author Joshua O'Madadhain | |
| 24 | */ | |
| 25 | 0 | public abstract class CollectionHypervertex extends AbstractHypervertex |
| 26 | { | |
| 27 | protected Collection incident_edges; | |
| 28 | ||
| 29 | /** | |
| 30 | * @see edu.uci.ics.jung.graph.impl.AbstractArchetypeVertex#getNeighbors_internal() | |
| 31 | */ | |
| 32 | protected Collection getNeighbors_internal() | |
| 33 | { | |
| 34 | 0 | Set neighbors = new HashSet(); |
| 35 | 0 | for (Iterator iter = incident_edges.iterator(); iter.hasNext(); ) |
| 36 | { | |
| 37 | 0 | Hyperedge e = (Hyperedge)iter.next(); |
| 38 | 0 | neighbors.addAll(e.getIncidentVertices()); |
| 39 | } | |
| 40 | 0 | return neighbors; |
| 41 | } | |
| 42 | ||
| 43 | /** | |
| 44 | * @see edu.uci.ics.jung.graph.impl.AbstractArchetypeVertex#getEdges_internal() | |
| 45 | */ | |
| 46 | protected Collection getEdges_internal() | |
| 47 | { | |
| 48 | 0 | return incident_edges; |
| 49 | } | |
| 50 | ||
| 51 | } |
|
this report was generated by version 1.0.5 of jcoverage. |
copyright © 2003, jcoverage ltd. all rights reserved. |