com.google.common.graph.Graph.edges()方法的使用及代码示例

x33g5p2x  于2022-01-20 转载在 其他  
字(10.3k)|赞(0)|评价(0)|浏览(160)

本文整理了Java中com.google.common.graph.Graph.edges()方法的一些代码示例，展示了Graph.edges()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Graph.edges()方法的具体详情如下：
包路径：com.google.common.graph.Graph
类名称：Graph
方法名：edges

Graph.edges介绍

[英]Returns all edges in this graph.
[中]返回此图中的所有边。

代码示例

代码示例来源：origin: google/guava

/**
 * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
 * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
 * and ending with the same node.
 *
 * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
 */
public static <N> boolean hasCycle(Graph<N> graph) {
 int numEdges = graph.edges().size();
 if (numEdges == 0) {
  return false; // An edge-free graph is acyclic by definition.
 }
 if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
  return true; // Optimization for the undirected case: at least one cycle must exist.
 }
 Map<Object, NodeVisitState> visitedNodes =
   Maps.newHashMapWithExpectedSize(graph.nodes().size());
 for (N node : graph.nodes()) {
  if (subgraphHasCycle(graph, visitedNodes, node, null)) {
   return true;
  }
 }
 return false;
}

代码示例来源：origin: google/guava

@Override
public final boolean equals(@Nullable Object obj) {
 if (obj == this) {
  return true;
 }
 if (!(obj instanceof Graph)) {
  return false;
 }
 Graph<?> other = (Graph<?>) obj;
 return isDirected() == other.isDirected()
   && nodes().equals(other.nodes())
   && edges().equals(other.edges());
}

代码示例来源：origin: google/guava

/** Returns an immutable copy of {@code graph}. */
public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) {
 return (graph instanceof ImmutableGraph)
   ? (ImmutableGraph<N>) graph
   : new ImmutableGraph<N>(
     new ConfigurableValueGraph<N, Presence>(
       GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size()));
}

代码示例来源：origin: google/guava

/**
 * Returns true if {@code network} has at least one cycle. A cycle is defined as a non-empty
 * subset of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges)
 * starting and ending with the same node.
 *
 * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
 */
public static boolean hasCycle(Network<?, ?> network) {
 // In a directed graph, parallel edges cannot introduce a cycle in an acyclic graph.
 // However, in an undirected graph, any parallel edge induces a cycle in the graph.
 if (!network.isDirected()
   && network.allowsParallelEdges()
   && network.edges().size() > network.asGraph().edges().size()) {
  return true;
 }
 return hasCycle(network.asGraph());
}

代码示例来源：origin: google/j2objc

/**
 * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset
 * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting
 * and ending with the same node.
 *
 * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
 */
public static <N> boolean hasCycle(Graph<N> graph) {
 int numEdges = graph.edges().size();
 if (numEdges == 0) {
  return false; // An edge-free graph is acyclic by definition.
 }
 if (!graph.isDirected() && numEdges >= graph.nodes().size()) {
  return true; // Optimization for the undirected case: at least one cycle must exist.
 }
 Map<Object, NodeVisitState> visitedNodes =
   Maps.newHashMapWithExpectedSize(graph.nodes().size());
 for (N node : graph.nodes()) {
  if (subgraphHasCycle(graph, visitedNodes, node, null)) {
   return true;
  }
 }
 return false;
}

代码示例来源：origin: google/j2objc

@Override
public final boolean equals(@NullableDecl Object obj) {
 if (obj == this) {
  return true;
 }
 if (!(obj instanceof Graph)) {
  return false;
 }
 Graph<?> other = (Graph<?>) obj;
 return isDirected() == other.isDirected()
   && nodes().equals(other.nodes())
   && edges().equals(other.edges());
}

代码示例来源：origin: google/guava

@Test
public void edges_containsOrderMismatch() {
 addEdge(N1, N2, E12);
 assertThat(network.asGraph().edges()).contains(ENDPOINTS_N2N1);
 assertThat(network.asGraph().edges()).contains(ENDPOINTS_N1N2);
}

代码示例来源：origin: google/j2objc

/** Returns an immutable copy of {@code graph}. */
public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) {
 return (graph instanceof ImmutableGraph)
   ? (ImmutableGraph<N>) graph
   : new ImmutableGraph<N>(
     new ConfigurableValueGraph<N, Presence>(
       GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size()));
}

代码示例来源：origin: google/guava

/** Creates a mutable copy of {@code graph} with the same nodes and edges. */
public static <N> MutableGraph<N> copyOf(Graph<N> graph) {
 MutableGraph<N> copy = GraphBuilder.from(graph).expectedNodeCount(graph.nodes().size()).build();
 for (N node : graph.nodes()) {
  copy.addNode(node);
 }
 for (EndpointPair<N> edge : graph.edges()) {
  copy.putEdge(edge.nodeU(), edge.nodeV());
 }
 return copy;
}

代码示例来源：origin: wildfly/wildfly

/** Returns an immutable copy of {@code graph}. */
public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) {
 return (graph instanceof ImmutableGraph)
   ? (ImmutableGraph<N>) graph
   : new ImmutableGraph<N>(
     new ConfigurableValueGraph<N, Presence>(
       GraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size()));
}

代码示例来源：origin: google/j2objc

/**
 * Returns true if {@code network} has at least one cycle. A cycle is defined as a non-empty
 * subset of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges)
 * starting and ending with the same node.
 *
 * <p>This method will detect any non-empty cycle, including self-loops (a cycle of length 1).
 */
public static boolean hasCycle(Network<?, ?> network) {
 // In a directed graph, parallel edges cannot introduce a cycle in an acyclic graph.
 // However, in an undirected graph, any parallel edge induces a cycle in the graph.
 if (!network.isDirected()
   && network.allowsParallelEdges()
   && network.edges().size() > network.asGraph().edges().size()) {
  return true;
 }
 return hasCycle(network.asGraph());
}

代码示例来源：origin: wildfly/wildfly

@Override
public final boolean equals(@NullableDecl Object obj) {
 if (obj == this) {
  return true;
 }
 if (!(obj instanceof Graph)) {
  return false;
 }
 Graph<?> other = (Graph<?>) obj;
 return isDirected() == other.isDirected()
   && nodes().equals(other.nodes())
   && edges().equals(other.edges());
}

代码示例来源：origin: google/guava

@Test
public void edges_containsOrderMismatch() {
 addEdge(N1, N2, E12);
 EndpointPair<Integer> endpointsN1N2 = EndpointPair.unordered(N1, N2);
 EndpointPair<Integer> endpointsN2N1 = EndpointPair.unordered(N2, N1);
 assertThat(network.asGraph().edges()).doesNotContain(endpointsN1N2);
 assertThat(network.asGraph().edges()).doesNotContain(endpointsN2N1);
}

代码示例来源：origin: Graylog2/graylog2-server

/**
   * Merge all nodes and edges of two graphs.
   *
   * @param graph1 A {@link MutableGraph} into which all nodes and edges of {@literal graph2} will be merged
   * @param graph2 The {@link Graph} whose nodes and edges will be merged into {@literal graph1}
   * @param <N>    The class of the nodes
   */
  public static <N> void merge(MutableGraph<N> graph1, Graph<N> graph2) {
    for (N node : graph2.nodes()) {
      graph1.addNode(node);
    }
    for (EndpointPair<N> edge : graph2.edges()) {
      graph1.putEdge(edge.nodeU(), edge.nodeV());
    }
  }
}

代码示例来源：origin: wildfly/wildfly

/** Creates a mutable copy of {@code graph} with the same nodes and edges. */
public static <N> MutableGraph<N> copyOf(Graph<N> graph) {
 MutableGraph<N> copy = GraphBuilder.from(graph).expectedNodeCount(graph.nodes().size()).build();
 for (N node : graph.nodes()) {
  copy.addNode(node);
 }
 for (EndpointPair<N> edge : graph.edges()) {
  copy.putEdge(edge.nodeU(), edge.nodeV());
 }
 return copy;
}

代码示例来源：origin: google/j2objc

/** Creates a mutable copy of {@code graph} with the same nodes, edges, and edge values. */
public static <N, V> MutableValueGraph<N, V> copyOf(ValueGraph<N, V> graph) {
 MutableValueGraph<N, V> copy =
   ValueGraphBuilder.from(graph).expectedNodeCount(graph.nodes().size()).build();
 for (N node : graph.nodes()) {
  copy.addNode(node);
 }
 for (EndpointPair<N> edge : graph.edges()) {
  copy.putEdgeValue(
    edge.nodeU(), edge.nodeV(), graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null));
 }
 return copy;
}

代码示例来源：origin: google/guava

sanityCheckSet(graph.edges());
assertThat(graph.edges()).doesNotContain(EndpointPair.of(graph, new Object(), new Object()));
assertThat(graph.edges()).isEqualTo(allEndpointPairs);

代码示例来源：origin: google/guava

@After
public void validateGraphState() {
 assertStronglyEquivalent(graph, Graphs.copyOf(graph));
 assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph));
 Graph<Integer> asGraph = graph.asGraph();
 AbstractGraphTest.validateGraph(asGraph);
 assertThat(graph.nodes()).isEqualTo(asGraph.nodes());
 assertThat(graph.edges()).isEqualTo(asGraph.edges());
 assertThat(graph.nodeOrder()).isEqualTo(asGraph.nodeOrder());
 assertThat(graph.isDirected()).isEqualTo(asGraph.isDirected());
 assertThat(graph.allowsSelfLoops()).isEqualTo(asGraph.allowsSelfLoops());
 for (Integer node : graph.nodes()) {
  assertThat(graph.adjacentNodes(node)).isEqualTo(asGraph.adjacentNodes(node));
  assertThat(graph.predecessors(node)).isEqualTo(asGraph.predecessors(node));
  assertThat(graph.successors(node)).isEqualTo(asGraph.successors(node));
  assertThat(graph.degree(node)).isEqualTo(asGraph.degree(node));
  assertThat(graph.inDegree(node)).isEqualTo(asGraph.inDegree(node));
  assertThat(graph.outDegree(node)).isEqualTo(asGraph.outDegree(node));
  for (Integer otherNode : graph.nodes()) {
   boolean hasEdge = graph.hasEdgeConnecting(node, otherNode);
   assertThat(hasEdge).isEqualTo(asGraph.hasEdgeConnecting(node, otherNode));
   assertThat(graph.edgeValueOrDefault(node, otherNode, null) != null).isEqualTo(hasEdge);
   assertThat(!graph.edgeValueOrDefault(node, otherNode, DEFAULT).equals(DEFAULT))
     .isEqualTo(hasEdge);
  }
 }
}

代码示例来源：origin: google/guava

@Test
public void endpointPair_directedNetwork() {
 MutableNetwork<Integer, String> directedNetwork =
   NetworkBuilder.directed().allowsSelfLoops(true).build();
 directedNetwork.addNode(N0);
 directedNetwork.addEdge(N1, N2, E12);
 directedNetwork.addEdge(N2, N1, E21);
 directedNetwork.addEdge(N1, N3, E13);
 directedNetwork.addEdge(N4, N4, E44);
 containsExactlySanityCheck(
   directedNetwork.asGraph().edges(),
   EndpointPair.ordered(N1, N2),
   EndpointPair.ordered(N2, N1),
   EndpointPair.ordered(N1, N3),
   EndpointPair.ordered(N4, N4));
}

代码示例来源：origin: google/guava

@Test
public void endpointPair_undirectedNetwork() {
 MutableNetwork<Integer, String> undirectedNetwork =
   NetworkBuilder.undirected().allowsParallelEdges(true).allowsSelfLoops(true).build();
 undirectedNetwork.addNode(N0);
 undirectedNetwork.addEdge(N1, N2, E12);
 undirectedNetwork.addEdge(N2, N1, E12_A); // adds parallel edge, won't be in Graph edges
 undirectedNetwork.addEdge(N1, N3, E13);
 undirectedNetwork.addEdge(N4, N4, E44);
 containsExactlySanityCheck(
   undirectedNetwork.asGraph().edges(),
   EndpointPair.unordered(N1, N2),
   EndpointPair.unordered(N1, N3),
   EndpointPair.unordered(N4, N4));
}

内容来源于网络，如有侵权，请联系作者删除！

Graph

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com