final
class
Graph[Key, A] extends AnyRef
Type Members
-
type
Entry = (A, (Keys, Keys))
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
add_deps_acyclic(y: Key, xs: List[Key]): Graph[Key, A]
-
def
add_edge(x: Key, y: Key): Graph[Key, A]
-
def
add_edge_acyclic(x: Key, y: Key): Graph[Key, A]
-
def
all_preds(xs: List[Key]): List[Key]
-
def
all_succs(xs: List[Key]): List[Key]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
default_node(x: Key, info: A): Graph[Key, A]
-
def
defined(x: Key): Boolean
-
def
del_edge(x: Key, y: Key): Graph[Key, A]
-
def
del_node(x: Key): Graph[Key, A]
-
def
dest: List[((Key, A), List[Key])]
-
def
edges_iterator: Iterator[(Key, Key)]
-
def
empty_keys: Keys
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
get_node(x: Key): A
-
def
hashCode(): Int
-
def
imm_preds(x: Key): Keys
-
def
imm_succs(x: Key): Keys
-
def
irreducible_paths(x: Key, y: Key): List[List[Key]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
is_edge(x: Key, y: Key): Boolean
-
-
def
is_maximal(x: Key): Boolean
-
def
is_minimal(x: Key): Boolean
-
def
iterator: Iterator[(Key, Entry)]
-
def
keys: List[Key]
-
def
keys_iterator: Iterator[Key]
-
def
map_node(x: Key, f: (A) ⇒ A): Graph[Key, A]
-
def
maximals: List[Key]
-
def
minimals: List[Key]
-
-
def
new_node(x: Key, info: A): Graph[Key, A]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
ordering: Ordering[Key]
-
def
reachable(next: (Key) ⇒ Keys, xs: List[Key]): (List[List[Key]], Keys)
-
def
restrict(pred: (Key) ⇒ Boolean): Graph[Key, A]
-
def
strong_conn: List[List[Key]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
topological_order: List[Key]
-
def
transitive_closure: Graph[Key, A]
-
def
transitive_reduction_acyclic: Graph[Key, A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
