about summary refs log tree commit diff
path: root/emacs/.emacs.d/wpc/graph.el
diff options
context:
space:
mode:
Diffstat (limited to 'emacs/.emacs.d/wpc/graph.el')
-rw-r--r--emacs/.emacs.d/wpc/graph.el4
1 files changed, 2 insertions, 2 deletions
diff --git a/emacs/.emacs.d/wpc/graph.el b/emacs/.emacs.d/wpc/graph.el
index c68c308590f4..30ed8aabe6b6 100644
--- a/emacs/.emacs.d/wpc/graph.el
+++ b/emacs/.emacs.d/wpc/graph.el
@@ -64,11 +64,11 @@ The user must pass in a valid Neighbors Table since asserting on the shape of
 ;; TODO: Model each of the mapping functions into an isomorphism.
 (defun graph/edges->neighbors (xs)
   "Map Edge List, XS, into a Neighbors Table."
-  (prelude/assert (graph/instance? xs)))
+  (prelude-assert (graph/instance? xs)))
 
 (defun graph/neighbors->edges (xs)
   "Map Neighbors Table, XS, into an Edge List."
-  (prelude/assert (graph/instance? xs)))
+  (prelude-assert (graph/instance? xs)))
 
 ;; Below are three different models of the same unweighted, directed graph.