dsep_test.go

package dsep

import (
	"fmt"
	"reflect"
	"testing"
)

func TestFindDSeperatioWithCommonCause(t *testing.T) {
	var adjlist = make([][]int, 3)
	adjlist[0] = []int{1, 2}
	adjlist[1] = []int{}
	adjlist[2] = []int{}
	ans, err := FindDSeperation(adjlist, 1, []int{0})
	if err != nil {
		t.Error(err)
	} else {
		expect := []int{2}
		if !reflect.DeepEqual(ans, expect) {
			t.Error("Expected ", expect, " got ", ans)
		}
	}
}

func TestFindDSeperatioWithTrail(t *testing.T) {
	var adjlist = make([][]int, 3)
	adjlist[0] = []int{1}
	adjlist[1] = []int{2}
	adjlist[2] = []int{}
	ans, err := FindDSeperation(adjlist, 0, []int{1})
	if err != nil {
		t.Error(err)
	} else {
		expect := []int{2}
		if !reflect.DeepEqual(ans, expect) {
			t.Error("Expected ", expect, " got ", ans)
		}
	}
}

func TestFindDSeperatioWithCommonEffect(t *testing.T) {
	var adjlist = make([][]int, 3)
	adjlist[0] = []int{}
	adjlist[1] = []int{0}
	adjlist[2] = []int{0}
	ans, err := FindDSeperation(adjlist, 1, []int{})
	if err != nil {
		t.Error(err)
	} else {
		expect := []int{2}
		if !reflect.DeepEqual(ans, expect) {
			t.Error("Expected ", expect, " got ", ans)
		}
	}
}

// This example creates a Baysian network, where node-0 has two parents: node-1 and node-2,
// when node-0 is not observed, node-1 is D-separated from node-2.
func Example_findDSeperationWithCommonEffect() {
	ans, err := FindDSeperation([][]int{[]int{}, []int{0}, []int{0}}, 1, []int{})
	if err != nil {
		panic(err)
	}
	fmt.Println(ans)
	// Output:
	// [2]
}