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 | * Created on Mar 5, 2004 | |
11 | */ | |
12 | package edu.uci.ics.jung.graph.impl; | |
13 | ||
14 | import java.util.Collection; | |
15 | ||
16 | ||
17 | /** | |
18 | * An implementation of <code>AbstractSparseGraph</code> that, by default, imposes no | |
19 | * constraints on the edges and vertices that may be added to it. As a result, | |
20 | * this class supports mixed-mode graphs (graphs with both directed and | |
21 | * undirected edges) and graphs with parallel edges. | |
22 | * <code>SparseVertex</code> is an appropriate vertex type for this graph. | |
23 | * | |
24 | * @see SparseVertex | |
25 | * @author Joshua O'Madadhain | |
26 | */ | |
27 | public class SparseGraph extends AbstractSparseGraph | |
28 | { | |
29 | public SparseGraph() | |
30 | { | |
31 | 545 | super(); |
32 | 545 | } |
33 | ||
34 | /** | |
35 | * Creates a new SparseGraph and adds the specified edge constraints. | |
36 | */ | |
37 | public SparseGraph(Collection edge_constraints) | |
38 | { | |
39 | 0 | super(); |
40 | 0 | getEdgeConstraints().addAll(edge_constraints); |
41 | 0 | } |
42 | } |
this report was generated by version 1.0.5 of jcoverage. |
copyright © 2003, jcoverage ltd. all rights reserved. |