• Home
• com.github.fdietze
• pharg_2.11
• 0.1.1
• source code

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

ietze.pharg_2.11.0.1.1.source-code.DSL.scala Maven / Gradle / Ivy

package pharg

object DSL {
  //TODO: graph dsl: LinkedHashSet for predictable vertex/edge traversal in tests
  //TODO: implicits for accessors: V,E

  // Graph construction
  def V(range: Range) = range.toSet
  def V[Vertex](vs: Vertex*) = Set(vs: _*)
  def e[Vertex](edge: (Vertex, Vertex)) = edge match { case (in, out) => Edge(in, out) }
  def E[Vertex](es: (Vertex, Vertex)*) = es.map { case (in, out) => Edge(in, out) }.toSet
  // def G[Vertex](
  //   V: Set[Vertex] = Set.empty[Vertex],
  //   E: Set[Edge[Vertex]] = Set.empty[Edge[Vertex]]
  // ) = DirectedGraph(V, E)

  def G[Vertex, VD, ED](
    V: Set[Vertex] = Set.empty[Vertex],
    E: Set[Edge[Vertex]] = Set.empty[Edge[Vertex]],
    vd: Map[Vertex, VD] = Map.empty[Vertex, VD],
    ed: Map[Edge[Vertex], ED] = Map.empty[Edge[Vertex], ED]
  ) = DirectedGraphData(V, E, vd, ed)

  def vData[Vertex, VD](data: (Vertex, VD)*) = data.map { case (v, datum) => v -> datum }.toMap
  def eData[Vertex, ED](data: ((Vertex, Vertex), ED)*) = data.map { case ((a, b), datum) => e(a -> b) -> datum }.toMap
}