quiver
package
quiver
Type Members
-
type
Adj[N, B] = Vector[(B, N)]
-
type
GraphRep[N, A, B] = Map[N, GrContext[N, A, B]]
-
type
LPath[N, A] = (N, Vector[(N, A)])
-
type
LRTree[N, A] = Stream[LPath[N, A]]
-
type
Path[N] = Vector[N]
-
type
RTree[N] = Stream[Path[N]]
-
type
UEdge[N] = LEdge[N, Unit]
-
type
UNode[N] = LNode[N, Unit]
Value Members
-
-
def
addPred[N, A, B](g: GraphRep[N, A, B], v: N, lss: Vector[(B, N)]): GraphRep[N, A, B]
-
def
addSucc[N, A, B](g: GraphRep[N, A, B], v: N, lps: Vector[(B, N)]): GraphRep[N, A, B]
-
def
banana(n: Int, k: Int): Graph[Int, Unit, Unit]
-
def
buildGraph[N, A, B](ctxs: Seq[Context[N, A, B]]): Graph[N, A, B]
-
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]
-
def
clearPred[N, A, B](g: GraphRep[N, A, B], v: N, ns: Vector[N]): GraphRep[N, A, B]
-
def
clearSucc[N, A, B](g: GraphRep[N, A, B], v: N, ns: Vector[N]): GraphRep[N, A, B]
-
implicit
def
contextOrder[N, A, B](implicit N: Order[N], A: Order[A], B: Order[B]): Order[Context[N, A, B]]
-
def
cycle[N](vs: Seq[N]): Graph[N, Unit, Unit]
-
implicit
def
edgeOrder[N, A](implicit N: Order[N]): Order[Edge[N]]
-
def
empty[N, A, B]: Graph[N, A, B]
-
def
fromAdj[N, B](adj: Adj[N, B]): Map[N, Set[B]]
-
implicit
def
gDecompOrder[N, A, B](implicit arg0: Order[N], arg1: Order[A], arg2: Order[B]): Order[GDecomp[N, A, B]]
-
def
getLPath[N, A](v: N, t: LRTree[N, A]): Option[LPath[N, A]]
-
def
getLPaths[N, A](v: N, t: LRTree[N, A]): Stream[LPath[N, A]]
-
def
getPath[N](v: N, t: RTree[N]): Option[Path[N]]
-
implicit
def
graphMonoid[N, A, B]: Monoid[Graph[N, A, B]]
-
implicit
def
graphOrder[N, A, B](implicit N: Order[N], A: Order[A], B: Order[B]): Order[Graph[N, A, B]]
-
implicit
def
ledgeOrder[N, A](implicit N: Order[N], A: Order[A]): Order[LEdge[N, A]]
-
def
mkGraph[N, A, B](vs: Seq[LNode[N, A]], es: Seq[LEdge[N, B]]): Graph[N, A, B]
-
implicit
def
nodeOrder[N, A](implicit N: Order[N], A: Order[A]): Order[LNode[N, A]]
-
def
poset[N, A](ns: Seq[(N, A)])(implicit N: PartialOrdering[N]): Graph[N, A, Unit]
-
def
reverseLPath[N, A](p: LPath[N, A]): LPath[N, A]
-
def
safeMkGraph[N, A, B](vs: Seq[LNode[N, A]], es: Seq[LEdge[N, B]]): Graph[N, A, B]
-
def
star(n: Int): Graph[Int, Unit, Unit]
-
def
toAdj[N, B](bs: Map[N, Set[B]]): Adj[N, B]
Inherited from AnyRef
Inherited from Any