Method node_weight

src/detector/lock/mod.rs:876–878

(&self, a: RelationId)

/// forall relation(a, b), relation(c, d): if b and c are probably/possibly deadlock,
/// then add edge between relation(a, b) and relation(c, d).
/// The cycles in the graph may be conflictlock bugs.
struct ConflictLockGraph {
    graph: Graph<(LockGuardId, LockGuardId), DeadlockPossibility, Directed>,
}