projects
/
cl-graph.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
fix bug in DFS, added rooted-dfs, improved docstring for find-vertex-between-edges-if
[cl-graph.git]
/
dev
/
package.lisp
diff --git
a/dev/package.lisp
b/dev/package.lisp
index
eb250c9
..
83e707f
100644
(file)
--- a/
dev/package.lisp
+++ b/
dev/package.lisp
@@
-10,8
+10,7
@@
DISCUSSION
(in-package #:common-lisp-user)
(defpackage #:cl-graph
(in-package #:common-lisp-user)
(defpackage #:cl-graph
- (:use #:common-lisp #:metatilities #:cl-containers
- #:metabang.bind)
+ (:use #:common-lisp #:metatilities #:cl-containers #:metabang-bind)
(:nicknames #:metabang.graph)
(:documentation "CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms.")
(:nicknames #:metabang.graph)
(:documentation "CL-Graph is a Common Lisp library for manipulating graphs and running graph algorithms.")
@@
-117,7
+116,9
@@
DISCUSSION
#:has-children-p
#:has-parent-p
#:number-of-neighbors
#:has-children-p
#:has-parent-p
#:number-of-neighbors
-
+ #:graph-vertexes
+ #:replace-vertex
+
#:edge-count ; graph
#:vertex-count ; graph
#:edge-count ; graph
#:vertex-count ; graph
@@
-145,7
+146,8
@@
DISCUSSION
#:edge-lessp-by-direction
#:out-edge-for-vertex-p
#:dfs
#:edge-lessp-by-direction
#:out-edge-for-vertex-p
#:dfs
-
+ #:rooted-dfs
+
;;; minimum-spanning-tree
#+Ignore #:add-edges-to-graph
;;; minimum-spanning-tree
#+Ignore #:add-edges-to-graph
@@
-160,7
+162,8
@@
DISCUSSION
#:project-bipartite-graph
#:make-vertex-edges-container
#:project-bipartite-graph
#:make-vertex-edges-container
-
+ #:make-vertex-for-graph
+
#:vertex-degree-counts
#:vertex-degree
#:average-vertex-degree
#:vertex-degree-counts
#:vertex-degree
#:average-vertex-degree
@@
-170,11
+173,16
@@
DISCUSSION
#:graph-mixing-matrix
#:graph-edge-mixture-matrix
#:assortativity-coefficient
#:graph-mixing-matrix
#:graph-edge-mixture-matrix
#:assortativity-coefficient
- #:vertex-degree-summary)
+ #:vertex-degree-summary
+ #:connected-components
+ #:average-local-clustering-coefficient
+ #:vertex-triangle-count
+ #:graph-edges
+ #:graph-vertexes)
(:export
#:print-dot-key-value
#:dot-attribute-value
#:dot-attributes-mixin
#:*dot-graph-attributes*
(:export
#:print-dot-key-value
#:dot-attribute-value
#:dot-attributes-mixin
#:*dot-graph-attributes*
- ))
\ No newline at end of file
+ ))