Node Labeling

[Sergey Kokorin]

Hi, 

I'm trying to mess up with the library somehow but I'm a bit lost. I'm not sure how it should be done properly. I need implement some thing like

def filter(g: Graph[N, E]): Graph[N, E] = {

val labeled: Graph[Labeled[N], E[?]] = label(g)

val filtered = filter(labeled)

val result: Graph[N, E] = removeLabel(filtered)

result

}

So I would like to label nodes do some filtration on edges based on the labels and return subgraph without labels with initial type N. How it could be done in a proper way if possible?

Best Regards,

Sergey

[Peter Empen]

 Sergey,

to discard labeled edges with a label type of String, you can do for instance:

import scalax.collection.GraphPredef._
import scalax.collection.edge.LDiEdge
import scalax.collection.edge.Implicits._
import scalax.collection.Graph

val g = Graph(1 ~> 2, 1 ~> 3 + "A", 2 ~> 3 + 7)

g -- g.edges.toOuter.collect {
  case e @ LDiEdge(s, t, label: String) => e
}