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 banana(n: Int, k: Int): Graph[Int, Unit, Unit]

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

6. 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]

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

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

9. implicit def contextOrder[N, A, B](implicit N: Order[N], A: Order[A], B: Order[B]): Order[Context[N, A, B]]

10. def cycle[N](vs: Seq[N]): Graph[N, Unit, Unit]

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

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

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

14. implicit def gdecompOrder[N, A, B](implicit arg0: Order[N], arg1: Order[A], arg2: Order[B]): Order[GDecomp[N, A, B]]

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

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

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

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

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

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

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

22. def poset[N, A](ns: Seq[(N, A)])(implicit N: PartialOrdering[N]): Graph[N, A, Unit]

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

24. def star(n: Int): Graph[Int, Unit, Unit]

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