graph_ccc.scala

// our CCC with Graph as morphism
implicit val GraphCCC: ClosedCartesianCat[Graph] = new ClosedCartesianCat[Graph] {
  // long boring useless code
}

// we can also implement CCCNumExt for Graph
implicit def GraphCCCNumExt[A](implicit N: Numeric[A], gp: GenPorts[A]): CCCNumExt[Graph, A] = new CCCNumExt[Graph, A] {
  // genComp just generate a component with 2 inputs, 1 output and a nice name
  def negateC: Graph[A, A]   = genComp("-")
  def addC: Graph[(A, A), A] = genComp("+")
  def mulC: Graph[(A, A), A] = genComp("*")
}