Module es.upm.fi.cig.multictbnc

Package es.upm.fi.cig.multictbnc.learning.structure.constraints.BN

Class DAG

java.lang.Object

es.upm.fi.cig.multictbnc.learning.structure.constraints.AbstractStructureConstraints

es.upm.fi.cig.multictbnc.learning.structure.constraints.BN.DAG

All Implemented Interfaces:

StructureConstraints

public class DAG
extends AbstractStructureConstraints

Defines the restrictions of a general directed acyclic graph.

Constructor Summary

Constructors

Constructor	Description
DAG()

Method Summary

Modifier and Type	Method	Description
boolean	isStructureLegal(boolean[][] adjacencyMatrix, NodeIndexer<? extends Node> nodeIndexer)	Checks if the structure (given by an adjacencyMatrix) is legal for a Bayesian network without restrictions.

Methods inherited from class es.upm.fi.cig.multictbnc.learning.structure.constraints.AbstractStructureConstraints

initialiseStructure, uniqueStructure

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DAG

public DAG()

Method Details

isStructureLegal

public boolean isStructureLegal(boolean[][] adjacencyMatrix,
 NodeIndexer<? extends Node> nodeIndexer)

Checks if the structure (given by an adjacencyMatrix) is legal for a Bayesian network without restrictions. The method determines if there are cycles in an adjacency matrix.

Parameters:

adjacencyMatrix - adjacency matrix

nodeIndexer - node indexer that allows access to information about the nodes

Returns:

true if the structure is valid, false otherwise

See Also:

• https://www.geeksforgeeks.org/detect-cycle-in-a-directed-graph-using-bfs.