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 any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  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: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd
  5. 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 any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  7. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. 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 any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. 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 any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. 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 any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. 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 any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def findAnswer(g1: Rdf.Graph, g2: Rdf.Graph): Try[List[(Rdf.BNode, Rdf.BNode)]]

  18. 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

  19. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  20. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  21. 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

  22. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  23. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  24. 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

  25. 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.

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

    Definition Classes
    AnyRef
  27. final def notify(): Unit

    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  29. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  30. def toString(): String

    Definition Classes
    AnyRef → Any
  31. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. 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 any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphIsomorphism: StringAdd).self
    Definition Classes
    StringAdd
  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphIsomorphism: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to ArrowAssoc[GraphIsomorphism[Rdf]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphIsomorphism: ArrowAssoc[GraphIsomorphism[Rdf]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: GraphIsomorphism[Rdf]

    Implicit information
    This member is added by an implicit conversion from GraphIsomorphism[Rdf] to Ensuring[GraphIsomorphism[Rdf]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (graphIsomorphism: Ensuring[GraphIsomorphism[Rdf]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped