| 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 java.util.Collection; | |
| 13 | ||
| 14 | import edu.uci.ics.jung.graph.UndirectedGraph; | |
| 15 | ||
| 16 | /** | |
| 17 | * An implementation of <code>Graph</code> that consists of a | |
| 18 | * <code>Vertex</code> set and an <code>UndirectedEdge</code> set. | |
| 19 | * <code>SimpleUndirectedSparseVertex</code> is an appropriate vertex type | |
| 20 | * for this graph. | |
| 21 | * | |
| 22 | * <p>Edge constraints imposed by this class: UNDIRECTED_EDGE, | |
| 23 | * NOT_PARALLEL_EDGE</p> | |
| 24 | * | |
| 25 | * @author Joshua O'Madadhain | |
| 26 | * @author Scott White | |
| 27 | * @author Danyel Fisher | |
| 28 | * | |
| 29 | * @see SimpleUndirectedSparseVertex | |
| 30 | * @see UndirectedSparseEdge | |
| 31 | */ | |
| 32 | public class UndirectedSparseGraph extends SparseGraph | |
| 33 | implements UndirectedGraph | |
| 34 | { | |
| 35 | ||
| 36 | /** | |
| 37 | * Creates an instance of a sparse undirected graph. | |
| 38 | */ | |
| 39 | public UndirectedSparseGraph() | |
| 40 | { | |
| 41 | 236 | super(); |
| 42 | // system_edge_requirements.add(UNDIRECTED_EDGE); | |
| 43 | // user_edge_requirements.add(NOT_PARALLEL_EDGE); | |
| 44 | 236 | Collection edge_predicates = |
| 45 | getEdgeConstraints(); | |
| 46 | 236 | edge_predicates.add(UNDIRECTED_EDGE); |
| 47 | 236 | edge_predicates.add(NOT_PARALLEL_EDGE); |
| 48 | 236 | } |
| 49 | } |
|
this report was generated by version 1.0.5 of jcoverage. |
copyright © 2003, jcoverage ltd. all rights reserved. |