prop
prop
nyaya.prop
Atom
Biconditional
Conjunction
CycleDetector
CycleDetector
Directed
GraphType
Undirected
CycleFree
Disjunction
Eval
EqualB
Eval
EvalOver
Implication
Input
Logic
Logic
LogicPropExt
Mapped
Named
Negation
Prop
AllPresentB
BlacklistB
EqualB
WhitelistB
PropA
PropA
Prop_AnyExt
Reduction
prop
/
nyaya.prop
/
CycleDetector
/
GraphType
GraphType
sealed abstract
class
GraphType
Graph
Supertypes
Known subtypes
class
Object
trait
Matchable
class
Any
object
Directed
.type
object
Undirected
.type
Value members
Value members
Abstract methods
def
check
[
A
,
B
,
I
](
vertices: (
A
,
B
)
=>
Iterator
[
B
],
id:
B
=>
I
): (
A
,
Iterator
[
B
])
=>
Option
[(
B
,
B
)]
Concrete methods
def
map
[
A
,
I
](
id:
A
=>
I
):
CycleDetector
[
Map
[
A
,
A
],
A
]
def
multimap
[
V
[
_
],
A
,
I
](
id:
A
=>
I
,
empty:
V
[
A
])(
implicit
ev:
V
[
A
]
<:<
Iterable
[
A
]):
CycleDetector
[
Map
[
A
,
V
[
A
]],
A
]
def
tree
[
A
,
I
](
vertices:
A
=>
Iterator
[
A
],
id:
A
=>
I
):
CycleDetector
[
Iterator
[
A
],
A
]