Class

edu.cmu.ml.rtw.pra.features

NodePairBfsPathFinder

Related Doc: package features

Permalink

class NodePairBfsPathFinder extends BfsPathFinder[NodePairInstance]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodePairBfsPathFinder
  2. BfsPathFinder
  3. PathFinder
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodePairBfsPathFinder(params: JValue, relation: String, relationMetadata: RelationMetadata, outputter: Outputter, fileUtil: FileUtil = new FileUtil)

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val allowedKeys: Seq[String]

    Permalink
    Definition Classes
    BfsPathFinder
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def bfsFromNode(graph: Graph, factory: PathTypeFactory, source: Int, target: Int, unallowedRelations: Set[Int], resultsByPathType: HashMap[PathType, HashSet[(Int, Int)]]): Map[Int, HashSet[PathType]]

    Permalink
    Definition Classes
    BfsPathFinder
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def createPathTypeFactory(params: JValue, graph: Graph): PathTypeFactory

    Permalink
    Definition Classes
    BfsPathFinder
  9. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  11. val factoryParams: JValue

    Permalink
    Definition Classes
    BfsPathFinder
  12. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def findPaths(data: Dataset[NodePairInstance]): Unit

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  14. def finished(): Unit

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  15. implicit val formats: DefaultFormats.type

    Permalink
    Definition Classes
    BfsPathFinder
  16. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. def getLocalSubgraph(instance: NodePairInstance): Subgraph

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  18. def getLocalSubgraphs(): Map[NodePairInstance, Subgraph]

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  19. def getPathCountMap(): Map[NodePairInstance, Map[PathType, Integer]]

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  20. def getPathCounts(): Map[PathType, Integer]

    Permalink
    Definition Classes
    BfsPathFinderPathFinder
  21. def getSubgraphForInstance(instance: NodePairInstance): Map[PathType, Set[(Int, Int)]]

    Permalink
    Definition Classes
    NodePairBfsPathFinderBfsPathFinder
  22. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  24. val logLevel: Int

    Permalink
    Definition Classes
    BfsPathFinder
  25. val maxFanOut: Int

    Permalink
    Definition Classes
    BfsPathFinder
  26. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  27. def nodePairMatchesInstance(pair: (Int, Int), instance: NodePairInstance): Boolean

    Permalink
    Definition Classes
    NodePairBfsPathFinderBfsPathFinder
  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  30. val numSteps: Int

    Permalink
    Definition Classes
    BfsPathFinder
  31. var results: Map[NodePairInstance, Subgraph]

    Permalink
    Definition Classes
    BfsPathFinder
  32. def runBfs(data: Dataset[NodePairInstance]): Map[NodePairInstance, Subgraph]

    Permalink
    Definition Classes
    BfsPathFinder
  33. def shouldSkip(source: Int, target: Int, node1: Int, node2: Int, relation: Int, exclude: Set[Int]): Boolean

    Permalink
    Definition Classes
    BfsPathFinder
  34. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  35. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from PathFinder[NodePairInstance]

Inherited from AnyRef

Inherited from Any

Ungrouped