Package edu.cmu.tetrad.search

Class FciOrientDijkstra.Graph

java.lang.Object

edu.cmu.tetrad.search.FciOrientDijkstra.Graph

Enclosing class:

FciOrientDijkstra

public static class FciOrientDijkstra.Graph
extends Object

Represents a graph for Dijkstra's algorithm.

Constructor Summary

Constructors

Constructor	Description
Graph(Graph graph, boolean potentiallyDirected)	Represents a graph used in Dijkstra's algorithm.

Method Summary

Modifier and Type	Method	Description
List<FciOrientDijkstra.DijkstraEdge>	getNeighbors(Node node)	Returns the neighbors of a node, reachable via DijkstraEdges in the grph.
Set<Node>	getNodes()	Returns the nodes in the graph.

Methods inherited from class java.lang.Object

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

Constructor Details

Graph

public Graph(Graph graph,
 boolean potentiallyDirected)

Represents a graph used in Dijkstra's algorithm.

Parameters:

graph - The graph.

potentiallyDirected - If true, the graph is potentially directed.

Method Details

getNeighbors

public List<FciOrientDijkstra.DijkstraEdge> getNeighbors(Node node)

Returns the neighbors of a node, reachable via DijkstraEdges in the grph.

Parameters:

node - The node.

Returns:

The neighbors of the node.

getNodes

public Set<Node> getNodes()

Returns the nodes in the graph.

Returns:

The nodes in the graph.