How to use

isDirected

method

in

com.google.common.graph.BaseGraph

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

@Override
public boolean isDirected() {
 return delegate().isDirected();
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

public static <N> IncidentEdgeSet<N> of(BaseGraph<N> graph, N node) {
 return graph.isDirected() ? new Directed<>(graph, node) : new Undirected<>(graph, node);
}

static <N> EndpointPairIterator<N> of(BaseGraph<N> graph) {
 return graph.isDirected() ? new Directed<N>(graph) : new Undirected<N>(graph);
}

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");

checkNotNull(tree);
if (tree instanceof BaseGraph) {
 checkArgument(((BaseGraph<?>) tree).isDirected(), "Undirected graphs can never be trees.");