edu.ksu.cis.bnj.bbn.learning.scorebased.gradient
Class MatrixGraph

java.lang.Object
  edu.ksu.cis.bnj.bbn.learning.scorebased.gradient.MatrixGraph

public class MatrixGraph

extends java.lang.Object

Author:

Prashanth Boddhireddy Note: row is a node and each column is the parent "Its not same as directed graph" 0 1 2 3 0 |0 0 0 0 | 1 |X 0 0 0 | 2 |X X 0 0 | 3 |X X X 0 |

Constructor Summary

MatrixGraph(boolean[][] graph)

MatrixGraph(int n)

Method Summary

void	createRandomGraph()
void	display()
void	generateAllNeigbourStructures()
int	getNoOfEdges()
static int[]	getRandomPermutation(int n)
static int[]	getRandomPermutation(int[] array, int length)
void	initializeGraph()
boolean	isCycle()
static void	main(java.lang.String[] args)
java.util.Set[]	matrixToAdjacencyList()
void	setRecentChange(int i, int j)

Methods inherited from class java.lang.Object

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

Constructor Detail

MatrixGraph

public MatrixGraph(int n)

MatrixGraph

public MatrixGraph(boolean[][] graph)

Method Detail

initializeGraph

public void initializeGraph()

createRandomGraph

public void createRandomGraph()

matrixToAdjacencyList

public java.util.Set[] matrixToAdjacencyList()

display

public void display()

isCycle

public boolean isCycle()

generateAllNeigbourStructures

public void generateAllNeigbourStructures()

main

public static void main(java.lang.String[] args)

getNoOfEdges

public int getNoOfEdges()

getRandomPermutation

public static int[] getRandomPermutation(int n)

getRandomPermutation

public static int[] getRandomPermutation(int[] array,
                                         int length)

setRecentChange

public void setRecentChange(int i,
                            int j)