Line | Hits | Source |
---|---|---|
1 | /* | |
2 | * Created on Apr 26, 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.HashSet; | |
15 | ||
16 | /** | |
17 | * An implementation of <code>Hypervertex</code> that maintains | |
18 | * independent <code>Set</code>s of incident edges and neighbors. | |
19 | * This allows query methods (e.g. <code>isIncident</code>) to | |
20 | * execute in O(1) time, but <code>findEdge</code> still requires | |
21 | * time proportional to the degree of this vertex. | |
22 | * | |
23 | * @author Joshua O'Madadhain | |
24 | */ | |
25 | public class SetHypervertex extends CollectionHypervertex | |
26 | { | |
27 | public SetHypervertex() | |
28 | 0 | { |
29 | // super(); | |
30 | 0 | initialize(); |
31 | 0 | } |
32 | ||
33 | protected void initialize() | |
34 | { | |
35 | 0 | incident_edges = new HashSet(); |
36 | 0 | super.initialize(); |
37 | 0 | } |
38 | } |
this report was generated by version 1.0.5 of jcoverage. |
copyright © 2003, jcoverage ltd. all rights reserved. |