org.w3.banana.isomorphism

GraphIsomorphism

class GraphIsomorphism[Rdf <: RDF] extends AnyRef

Methods to establish Graph Equivalences

Following Jeremy J. Carroll's "Matching RDF Graphs" article http://www.hpl.hp.com/techreports/2001/HPL-2001-293.pdf

Also I found it useful to think in terms of the RDF category as defined by Benjamin Braatz in "Formal Modelling and Application of Graph Transformations in the Resource Description Framework" Proposition 2.1 ( p 16 )

http://www.researchgate.net/profile/Benjamin_Braatz/publication/40635984_Formal_Modelling_and_Application_of_Graph_Transformations_in_the_Resource_Description_Framework/file/d912f50d3189b51ef1.pdf

This code can be ameliorated in a number of ways:

- by using lazy data structures - by optimising memory

Rdf

RDF implementation to work with

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphIsomorphism
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphIsomorphism(mappingGen: MappingGenerator[Rdf], maxComplexity: Int = 65536)(implicit ops: RDFOps[Rdf])

    mappingGen

    a mapping generator that knows to find for two graphs the possible mappings of bnodes between them. Better mapping generators will find less mappings for the same graphs, without missing out on correct ones.

Type Members

  1. case class NoMappingException(reasons: EphemeralStream[(List[(Rdf.BNode, Rdf.BNode)], List[MappingException])]) extends Throwable with MappingError with Product with Serializable

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to any2stringadd[GraphIsomorphism[Rdf]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd

  4. def ->[B](y: B): (GraphIsomorphism[Rdf], B)

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to ArrowAssoc[GraphIsomorphism[Rdf]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def ensuring(cond: (GraphIsomorphism[Rdf]) ⇒ Boolean, msg: ⇒ Any): GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  9. def ensuring(cond: (GraphIsomorphism[Rdf]) ⇒ Boolean): GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  10. def ensuring(cond: Boolean, msg: ⇒ Any): GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  11. def ensuring(cond: Boolean): GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  12. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. def findAnswer(g1: Rdf.Graph, g2: Rdf.Graph): Try[List[(Rdf.BNode, Rdf.BNode)]]

  16. def findPossibleMappings(g1: Rdf.Graph, g2: Rdf.Graph): Try[EphemeralStream[List[(Rdf.BNode, Rdf.BNode)]]]

    Find possible bnode mappings

    Find possible bnode mappings

    returns

    A list of possible bnode mappings or a reason for the error

  17. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to StringFormat[GraphIsomorphism[Rdf]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  19. def groundTripleFilter(graph: Rdf.Graph): (Rdf.Graph, Rdf.Graph)

    filter a graphs into two subgraphs the first one containing no blank nodes the other one containing only statements with blank nodes

    filter a graphs into two subgraphs the first one containing no blank nodes the other one containing only statements with blank nodes

    returns

    a pair of Ground graph and non ground graph

  20. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  21. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  22. def mapVerify(graph1: Rdf.Graph, graph2: Rdf.Graph, mapping: List[(Rdf.BNode, Rdf.BNode)]): List[MappingException]

    Verify that the bnode bijection allows one to map graph1 to graph2

    Verify that the bnode bijection allows one to map graph1 to graph2

    mapping

    the mappings to verify.

    returns

    a list of exceptions in case of failure or an empty list in case of success

  23. val mappingGen: MappingGenerator[Rdf]

    a mapping generator that knows to find for two graphs the possible mappings of bnodes between them.

    a mapping generator that knows to find for two graphs the possible mappings of bnodes between them. Better mapping generators will find less mappings for the same graphs, without missing out on correct ones.

  24. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  25. final def notify(): Unit

    Definition Classes
    AnyRef

  26. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  28. def toString(): String

    Definition Classes
    AnyRef → Any

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  32. def →[B](y: B): (GraphIsomorphism[Rdf], B)

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to ArrowAssoc[GraphIsomorphism[Rdf]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from GraphIsomorphism[Rdf] to any2stringadd[GraphIsomorphism[Rdf]]

Inherited by implicit conversion StringFormat from GraphIsomorphism[Rdf] to StringFormat[GraphIsomorphism[Rdf]]

Inherited by implicit conversion Ensuring from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]]

Inherited by implicit conversion ArrowAssoc from GraphIsomorphism[Rdf] to ArrowAssoc[GraphIsomorphism[Rdf]]

Ungrouped