Coverage details for edu.uci.ics.jung.graph.impl.DirectedSparseGraph

LineHitsSource
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.DirectedGraph;
15  
16 /**
17  * An implementation of <code>Graph</code> that consists of a
18  * <code>Vertex</code> set and a <code>DirectedEdge</code> set.
19  * This implementation does NOT ALLOW parallel edges.
20  * <code>SimpleDirectedSparseVertex</code> is the most efficient
21  * vertex for this graph type.
22  *
23  * <p>Edge constraints imposed by this class: DIRECTED_EDGE, NOT_PARALLEL_EDGE
24  *
25  * <p>For additional system and user constraints defined for
26  * this class, see the superclasses of this class.</p>
27  *
28  * @author Scott D. White
29  * @author Danyel Fisher
30  * @author Joshua O'Madadhain
31  *
32  * @see DirectedSparseVertex
33  * @see DirectedSparseEdge
34  */
35 public class DirectedSparseGraph extends SparseGraph
36     implements DirectedGraph {
37  
38     /**
39      * Creates an instance of a sparse directed graph.
40      */
41     public DirectedSparseGraph() {
42206        super();
43 // system_edge_requirements.add(DIRECTED_EDGE);
44 // user_edge_requirements.add(NOT_PARALLEL_EDGE);
45206        Collection edge_predicates =
46             getEdgeConstraints();
47206        edge_predicates.add(DIRECTED_EDGE);
48206        edge_predicates.add(NOT_PARALLEL_EDGE);
49206    }
50 }

this report was generated by version 1.0.5 of jcoverage.
visit www.jcoverage.com for updates.

copyright © 2003, jcoverage ltd. all rights reserved.
Java is a trademark of Sun Microsystems, Inc. in the United States and other countries.