 (defn edges
   "Returns all edges in graph."
   [^Graph graph]
-  (map (partial j-edge->edge graph) (.getEdges graph)))
+  (map ->edge (.getEdges graph)))
 
 (defn in-edges
   "Returns incoming edges incident to node in graph."
   [^Graph graph node]
-  (map (partial j-edge->edge graph) (.getInEdges graph node)))
+  (map ->edge (.getInEdges graph node)))
 
 (defn degree
   "Returns the number of edges incident to node."

       (doto graph
         (.addVertex a)
         (.addVertex b)
         (.addEdge (edge->j-edge edge) a b)))
     graph)))

(defn directed-multigraph

                                   UndirectedSparseMultigraph]
           edu.uci.ics.jung.graph.util.Pair))

(deftype InnerEdge [src-node dst-node])

(defn- inner-edge
  [edge]
  (apply ->InnerEdge edge))

(defn- ->edge
  [^InnerEdge inner-edge]
  [(.src-node inner-edge) (.dst-node inner-edge)])

;; Constructor
;; -----------
