quiver

Value Members

1. object GraphCodecs

   

2. def addPred[N, A, B](g: GraphRep[N, A, B], v: N, lss: Vector[(B, N)]): GraphRep[N, A, B]

   

3. def addSucc[N, A, B](g: GraphRep[N, A, B], v: N, lps: Vector[(B, N)]): GraphRep[N, A, B]

   

4. def buildGraph[N, A, B](ctxs: Seq[Context[N, A, B]]): Graph[N, A, B]

   

5. def clear[N, A, B](g: GraphRep[N, A, B], v: N, ns: Vector[N], f: (GrContext[N, A, B]) ⇒ GrContext[N, A, B]): GraphRep[N, A, B]

   

6. def clearPred[N, A, B](g: GraphRep[N, A, B], v: N, ns: Vector[N]): GraphRep[N, A, B]

   

7. def clearSucc[N, A, B](g: GraphRep[N, A, B], v: N, ns: Vector[N]): GraphRep[N, A, B]

   

8. implicit def edgeOrder[N, A](implicit N: Order[N]): Order[Edge[N]]

   

9. def empty[N, A, B]: Graph[N, A, B]

   

10. def fromAdj[N, B](adj: Adj[N, B]): Map[N, Set[B]]

    

11. def getLPath[N, A](v: N, t: LRTree[N, A]): Option[LPath[N, A]]

    

12. def getPath[N](v: N, t: RTree[N]): Option[Path[N]]

    

13. implicit def graphMonoid[N, A, B]: Monoid[Graph[N, A, B]]

    

14. implicit def graphOrder[N, A, B](implicit N: Order[N], A: Order[A], B: Order[B]): Order[Graph[N, A, B]]

    

15. implicit def ledgeOrder[N, A](implicit N: Order[N], A: Order[A]): Order[LEdge[N, A]]

    

16. def mkGraph[N, A, B](vs: Seq[LNode[N, A]], es: Seq[LEdge[N, B]]): Graph[N, A, B]

    

17. implicit def nodeOrder[N, A](implicit N: Order[N], A: Order[A]): Order[LNode[N, A]]

    

18. def safeMkGraph[N, A, B](vs: Seq[LNode[N, A]], es: Seq[LEdge[N, B]]): Graph[N, A, B]

    

19. def toAdj[N, B](bs: Map[N, Set[B]]): Adj[N, B]