Improved efficiency of edge-count for graphs in general (from (length (graph-edges...

[cl-graph.git] / dev / graph-container.lisp

diff --git a/dev/graph-container.lisp b/dev/graph-container.lisp
index 5cfeed9..0865b2f 100644 (file)
--- a/dev/graph-container.lisp
+++ b/dev/graph-container.lisp
@@ -3,10 +3,6 @@
 
 $Id: graph-container.lisp,v 1.12 2005/07/20 20:39:09 moody Exp $
 
-Copyright 1992 - 2003 Experimental Knowledge Systems Lab, 
-University of Massachusetts Amherst MA, 01003-4610
-Professor Paul Cohen, Director
-
 Author: Gary King
 
 DISCUSSION
@@ -66,11 +62,6 @@ DISCUSSION
 
 ;;; ---------------------------------------------------------------------------
 
-#+COPYING 
-(defcopy-methods graph-container-vertex :copy-all t)
-
-;;; ---------------------------------------------------------------------------
-
 (defmethod make-vertex-edges-container ((vertex graph-container-vertex) 
                                         container-class &rest args)
   (apply #'make-container container-class args))
@@ -217,7 +208,6 @@ DISCUSSION
 
 ;;; ---------------------------------------------------------------------------
 
-
 (defmethod find-edge ((graph graph-container) (edge graph-container-edge)
                       &optional error-if-not-found?)
   (find-edge-between-vertexes
@@ -321,7 +311,8 @@ DISCUSSION
   
   (values nil))
 
+;;; ---------------------------------------------------------------------------
+
+(defmethod edge-count ((graph graph-container))
+  (size (graph-edges graph)))
 
-;;; ***************************************************************************
-;;; *                              End of File                                *
-;;; ***************************************************************************
\ No newline at end of file