Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 26 for subgraph (0.07 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. build-logic-settings/architecture-docs/src/main/kotlin/gradlebuild/GeneratorTask.kt

                } else {
                    writer.element(element)
                }
            }
            println(endDiagram)
        }
    
        private fun NodeWriter.platform(platform: Platform) {
            println()
            node("subgraph ${platform.id}[\"${platform.name} platform\"]") {
                for (child in platform.children) {
                    element(child)
                }
            }
            node("end")
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Fri Jan 30 15:37:56 GMT 2026
    - 3.8K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/graph/Traverser.java

     * based on your answers to the following questions:
     *
     * <ol>
     *   <li>Is there only one path to any node that's reachable from any start node? (If so, the graph
     *       to be traversed is a tree or forest even if it is a subgraph of a graph which is neither.)
     *   <li>Are the node objects' implementations of {@code equals()}/{@code hashCode()} <a
     *       href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursive</a>?
     * </ol>
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 19.3K bytes
    - Click Count (0)
  3. tensorflow/c/eager/c_api_distributed_test.cc

        // During execution:
        //   * task:0 processes main function `VariableAddFunctionWithGraphError`
        //     and places the 'read0_maybe_with_graph_error' op on task:2
        //   * task:0 partitions the main function with a subgraph containing
        //     'read0_maybe_with_graph_error' sent to task:2
        //   * task:2 graph pass reports an error when it sees
        //     'read0_maybe_with_graph_error' with dev2_name
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Sat Oct 12 05:11:17 GMT 2024
    - 23.4K bytes
    - Click Count (0)
  4. docs/de/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Nicht unterstützt"
            direction TB
            subgraph V2["Pydantic-v2-Modell"]
                V1Field["Pydantic-v1-Modell"]
            end
            subgraph V1["Pydantic-v1-Modell"]
                V2Field["Pydantic-v2-Modell"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 6.2K bytes
    - Click Count (0)
  5. docs/es/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:15:55 GMT 2026
    - 5.7K bytes
    - Click Count (0)
  6. docs/pt/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 5.8K bytes
    - Click Count (0)
  7. docs/fr/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 6.2K bytes
    - Click Count (0)
  8. docs/tr/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Mar 20 07:53:17 GMT 2026
    - 6K bytes
    - Click Count (0)
  9. docs/uk/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    Pydantic не підтримує ситуацію, коли модель Pydantic v2 має власні поля, визначені як моделі Pydantic v1, або навпаки.
    
    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:27:41 GMT 2026
    - 7.7K bytes
    - Click Count (0)
  10. docs/ru/docs/how-to/migrate-from-pydantic-v1-to-pydantic-v2.md

    ```mermaid
    graph TB
        subgraph "❌ Not Supported"
            direction TB
            subgraph V2["Pydantic v2 Model"]
                V1Field["Pydantic v1 Model"]
            end
            subgraph V1["Pydantic v1 Model"]
                V2Field["Pydantic v2 Model"]
            end
        end
    
        style V2 fill:#f9fff3
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:56:20 GMT 2026
    - 8.2K bytes
    - Click Count (0)
Back to Top