- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 58 for Directed (0.57 sec)
-
android/guava-tests/test/com/google/common/graph/GraphsTest.java
public void transitiveClosure_directedGraph() { MutableGraph<Integer> directedGraph = GraphBuilder.directed().allowsSelfLoops(false).build(); directedGraph.putEdge(N1, N2); directedGraph.putEdge(N1, N3); directedGraph.putEdge(N2, N3); directedGraph.addNode(N4); MutableGraph<Integer> expectedClosure = GraphBuilder.directed().allowsSelfLoops(true).build(); expectedClosure.putEdge(N1, N1); expectedClosure.putEdge(N1, N2);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 24.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /** * Creates a graph from a list of node pairs (encoded as strings, e.g. "ab" means that this graph
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /** * Creates a graph from a list of node pairs (encoded as strings, e.g. "ab" means that this graph
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 47.5K bytes - Viewed (2) -
guava/src/com/google/common/graph/MutableValueGraph.java
* that edge to {@code value} (overwriting the existing value, if any). * * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be * undirected. * * <p>If this graph is directed, {@code endpoints} must be ordered. * * <p>Values do not have to be unique. However, values must be non-null. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
* endpoints}) if one is not already present. * * <p>If this graph is directed, {@code endpoints} must be ordered and the added edge will be * directed; if it is undirected, the added edge will be undirected. * * <p>If this graph is directed, {@code endpoints} must be ordered. * * <p>If either or both endpoints are not already present in this graph, this method will silently
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 3.8K bytes - Viewed (0) -
cmd/crossdomain-xml-handler.go
// or Adobe Acrobat (though not necessarily limited to these), permission to handle data across domains. // When clients request content hosted on a particular source domain and that content make requests // directed towards a domain other than its own, the remote domain needs to host a cross-domain // policy file that grants access to the source domain, allowing the client to continue the transaction.
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Mar 18 06:42:40 UTC 2024 - 2.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/Network.java
*/ Graph<N> asGraph(); // // Network properties // /** * Returns true if the edges in this network are directed. Directed edges connect a {@link * EndpointPair#source() source node} to a {@link EndpointPair#target() target node}, while * undirected edges connect a pair of nodes to each other. */ boolean isDirected();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 22:03:02 UTC 2025 - 22.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/DefaultNetworkImplementationsTest.java
new Object[][] { {UNDIRECTED}, {DIRECTED}, }); } private final EdgeType edgeType; public DefaultNetworkImplementationsTest(EdgeType edgeType) { this.edgeType = edgeType; } @Before public void setUp() throws Exception { NetworkBuilder<Object, Object> builder = (edgeType == EdgeType.DIRECTED) ? NetworkBuilder.directed() : NetworkBuilder.undirected();
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 7.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPairIterator.java
successorIterator = graph.successors(node).iterator(); return true; } /** * If the graph is directed, each ordered [source, target] pair will be visited once if there is * an edge connecting them. */ private static final class Directed<N> extends EndpointPairIterator<N> { private Directed(BaseGraph<N> graph) { super(graph); } @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraphBuilder.java
/** Creates a new instance with the specified edge directionality. */ private ValueGraphBuilder(boolean directed) { super(directed); } /** Returns a {@link ValueGraphBuilder} for building directed graphs. */ public static ValueGraphBuilder<Object, Object> directed() { return new ValueGraphBuilder<>(true); } /** Returns a {@link ValueGraphBuilder} for building undirected graphs. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 7.9K bytes - Viewed (0)