DependencyGraph

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. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

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

   Definition Classes

   Any

6. def areConnected(vertices: Iterable[DependencyNode]): Boolean

   Test if the nodes are connected.

   Test if the nodes are connected. In other words, for each node, there exists another node in the set that is its neighbor.

   Definition Classes

   Graph

7. def areNeighbors(a: DependencyNode, b: DependencyNode): Boolean

   Test if the two nodes border each other.

   Test if the two nodes border each other.

   Definition Classes

   Graph

8. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

9. def bipaths(vertices: Set[DependencyNode], maxLength: Option[Int] = None): Set[Bipath[DependencyNode]]

   Definition Classes

   Graph

10. def bipaths(start: DependencyNode, end: DependencyNode): List[Bipath[DependencyNode]]

    Definition Classes

    Graph

11. def canEqual(that: Any): Boolean

    Definition Classes

    Graph

12. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def collapse: DependencyGraph

    Approximate Stanford's procedure to create collapsed dependencies.

14. def collapse(set: Set[DependencyNode])(implicit merge: (Traversable[DependencyNode]) ⇒ DependencyNode): Graph[DependencyNode]

    Definition Classes

    Graph

15. def collapse(collapsable: (E) ⇒ Boolean)(implicit merge: (Traversable[DependencyNode]) ⇒ DependencyNode): G

    Definition Classes

    Graph

16. def collapseGroups(groups: Iterable[Set[DependencyNode]])(implicit merge: (Traversable[DependencyNode]) ⇒ DependencyNode): Graph[DependencyNode]

    Definition Classes

    Graph

17. def collapseXNsubj: DependencyGraph

    Simplify xsubj and nsubj to just subj.

18. def components(pred: (Edge[DependencyNode]) ⇒ Boolean): Set[Set[DependencyNode]]

    Definition Classes

    Graph

19. def connected(v: DependencyNode, pred: (DirectedEdge[DependencyNode]) ⇒ Boolean): Set[DependencyNode]

    Definition Classes

    Graph

20. def dedges(vertex: DependencyNode): Set[DirectedEdge[DependencyNode]]

    Definition Classes

    Graph

21. def degree(v: DependencyNode): Int

    Definition Classes

    Graph

22. val dependencies: Set[Edge[DependencyNode]]

23. def edges(vertex: DependencyNode): Set[E]

    Definition Classes

    Graph

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

    Definition Classes

    AnyRef

25. def equals(that: Any): Boolean

    Definition Classes

    Graph → AnyRef → Any

26. def expand(vertices: Set[DependencyNode], pred: (DirectedEdge[DependencyNode]) ⇒ Boolean): Set[DependencyNode]

    Definition Classes

    Graph

27. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    Definition Classes

    AnyRef → Any

29. def hashCode(): Int

    Definition Classes

    AnyRef → Any

30. val incoming: Map[DependencyNode, Set[Edge[DependencyNode]]]

    Definition Classes

    Graph

31. def indegree(v: DependencyNode): Int

    Definition Classes

    Graph

32. def inferiors(v: DependencyNode, cond: (E) ⇒ Boolean = x => true): Set[DependencyNode]

    Iteratively expand a vertex to all vertices beneath it.

    Iteratively expand a vertex to all vertices beneath it.

    returns

    the set of vertices beneath vertex

    Definition Classes

    Graph

33. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

34. def isTree(): Boolean

    Definition Classes

    Graph

35. def joined: JoinedDependencyGraph

36. def map[U](f: (DependencyNode) ⇒ U): Graph[U]

    Definition Classes

    Graph

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

    Definition Classes

    AnyRef

38. def neighbors(v: DependencyNode): Set[DependencyNode]

    all vertices seperated from v.

    all vertices seperated from v.

    Definition Classes

    Graph

39. def neighbors(v: DependencyNode, pred: (DirectedEdge[DependencyNode]) ⇒ Boolean): Set[DependencyNode]

    all vertices seperated from v by a single edge that satisfied pred.

    all vertices seperated from v by a single edge that satisfied pred.

    Definition Classes

    Graph

40. def nodeById(id: Int): Option[DependencyNode]

41. val nodes: Set[DependencyNode]

42. final def notify(): Unit

    Definition Classes

    AnyRef

43. final def notifyAll(): Unit

    Definition Classes

    AnyRef

44. def outdegree(v: DependencyNode): Int

    Definition Classes

    Graph

45. val outgoing: Map[DependencyNode, Set[Edge[DependencyNode]]]

    Definition Classes

    Graph

46. def predecessors(v: DependencyNode, pred: (Edge[DependencyNode]) ⇒ Boolean): Set[DependencyNode]

    all vertices before incoming edges to v that satisfy the supplied predicate.

    all vertices before incoming edges to v that satisfy the supplied predicate.

    Definition Classes

    Graph

47. def predecessors(v: DependencyNode): Set[DependencyNode]

    all vertices before incoming edges to v.

    all vertices before incoming edges to v.

    Definition Classes

    Graph

48. def print(): Unit

    Definition Classes

    Graph

49. def print(writer: Appendable): Unit

    Definition Classes

    Graph

50. val root: Option[DependencyNode]

51. def successors(v: DependencyNode, pred: (Edge[DependencyNode]) ⇒ Boolean): Set[DependencyNode]

    all vertices after outgoing edges to v that satisfy the supplied predicate.

    all vertices after outgoing edges to v that satisfy the supplied predicate.

    Definition Classes

    Graph

52. def successors(v: DependencyNode): Set[DependencyNode]

    all vertices after outgoing edges to v.

    all vertices after outgoing edges to v.

    Definition Classes

    Graph

53. def superior(vertices: Set[DependencyNode]): DependencyNode

    Find the node which is most superior.

    Find the node which is most superior.

    Definition Classes

    Graph

    Exceptions thrown

    IllegalArgumentException

    nodes are not connected or no one superior

54. def superiors(v: DependencyNode, cond: (E) ⇒ Boolean = x => true): Set[DependencyNode]

    Iteratively expand a vertex to all vertices above it.

    Iteratively expand a vertex to all vertices above it.

    returns

    the set of vertices beneath vertex

    Definition Classes

    Graph

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

    Definition Classes

    AnyRef

56. def toDot(): String

    Definition Classes

    Graph

57. def toString(): String

    Definition Classes

    DependencyGraph → Graph → AnyRef → Any

58. def tokenized(tokens: Seq[Lemmatized[PostaggedToken]]): Graph[TokenDependencyNode]

59. def vertexBipaths(start: DependencyNode, end: DependencyNode): List[List[DependencyNode]]

    Find a path from vertex (start) to vertex (end).

    Find a path from vertex (start) to vertex (end).

    Definition Classes

    Graph

60. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )