anytimeExactBeliefPropagation.Model.BFS Maven / Gradle / Ivy

Go to download
package anytimeExactBeliefPropagation.Model;

import java.util.*;

import com.sri.ai.util.collect.ManyToManyRelation;

import anytimeExactBeliefPropagation.Model.Node.FactorNode;
import anytimeExactBeliefPropagation.Model.Node.VariableNode;

public class BFS implements Iterator {
    private Set visited = new HashSet<>();
    private Queue queue = new LinkedList<>();
    private ManyToManyRelation graph;

    public BFS(ManyToManyRelation g, VariableNode query) {
        if (g.containsA(query)) {
            this.graph = g;
            Set factorsLinkedToQuery = new HashSet<>();
            factorsLinkedToQuery.addAll(graph.getBsOfA(query));
            this.queue.addAll(factorsLinkedToQuery);
            this.visited.addAll(factorsLinkedToQuery);
        }else{
            throw new IllegalArgumentException("Vertext does not exits");
        }
    }
    
    public BFS(Model m) {
    		this(m.getEntireGraph(),m.getQuery());
    }
    
    @Override
    public void remove() {
        throw new UnsupportedOperationException();
    }

    @Override
    public boolean hasNext() {
        return !this.queue.isEmpty();
    }

    @Override
    public FactorNode next() {
        if (!hasNext())
            throw new NoSuchElementException();
        // removes from front of queue
        FactorNode next = queue.remove();
        for (VariableNode neighorVariable : graph.getAsOfB(next)) {
	        	for (FactorNode neighborFactor : graph.getBsOfA(neighorVariable)) {
	        		 if (!this.visited.contains(neighborFactor)) {
	                     this.queue.add(neighborFactor);
	                     this.visited.add(neighborFactor);
	        		 }
	        	}
        }
        return next;
    }

}
//
// public class BFS implements Iterator {
//    private Set visited = new HashSet<>();
//    private Queue queue = new LinkedList<>();
//    private ManyToManyRelation graph;
//
//    public BFS(ManyToManyRelation g, V query) {
//        if (g.containsA(query)) {
//            this.graph = g;
//            Set factorsLinkedToQuery = new HashSet<>();
//            factorsLinkedToQuery.addAll(graph.getBsOfA(query));
//            this.queue.addAll(factorsLinkedToQuery);
//            this.visited.addAll(factorsLinkedToQuery);
//        }else{
//            throw new IllegalArgumentException("Vertext does not exits");
//        }
//    }
//    
//    @Override
//    public void remove() {
//        throw new UnsupportedOperationException();
//    }
//
//    @Override
//    public boolean hasNext() {
//        return !this.queue.isEmpty();
//    }
//
//    @Override
//    public F next() {
//        if (!hasNext())
//            throw new NoSuchElementException();
//        // removes from front of queue
//        F next = queue.remove();
//        for (V neighorVariable : graph.getAsOfB(next)) {
//	        	for (F neighborFactor : graph.getBsOfA(neighorVariable)) {
//	        		 if (!this.visited.contains(neighborFactor)) {
//	                     this.queue.add(neighborFactor);
//	                     this.visited.add(neighborFactor);
//	        		 }
//	        	}
//        }
//        return next;
//    }
//
//}