Table of Contents
usage instructions
Adjacency method
algorithm
Example
Output
Adjacency list method
in conclusion
Home Backend Development C++ Check if there is a cycle of length 3 in the graph that satisfies the given condition

Check if there is a cycle of length 3 in the graph that satisfies the given condition

Sep 06, 2023 pm 01:01 PM
Check the loop in the graph

Check if there is a cycle of length 3 in the graph that satisfies the given condition

Checks the graph for a loop of length 3 that satisfies the given criteria, preparing to repeatedly traverse each vertex and look at its neighboring vertices. If a vertex has two neighbors that are too connected, a cycle of length 3 exists. This condition guarantees that there is an edge between two neighbors, thus forming a triangle. By filtering all vertices and their neighboring vertices, we will identify whether such a cycle exists. If we find that a vertex has two related neighbors, we can conclude that the graph shows a cycle of length 3 that satisfies the given condition.

usage instructions

  • Adjacency matrix method

  • Adjacency list method

Adjacency method

To check if there is a cycle of length 3 in the graph that satisfies a given condition, we can make use of the contagious method. In this approach, we iterate for each vertex in the graph and check its neighboring vertices. For each vertex, we check whether any two of its neighboring vertices are too closely related. If such a match is found, we check whether the conditions for that match are met. If the condition is met, it indicates a loop of length 3 that is close to satisfying the given condition. By looking at all the vertices in the graph, we can determine if such a cycle exists.

algorithm

  • Initialize the Boolean variable named "cycleExists" to false.

  • Iterate over each vertex in the graph:

    • For each vertex, repeat its adjacent vertices.

    • For each adjacent vertex, emphasize its adjacent vertices (except the current vertex).

    • If any two adjacent vertices are related, continue to the next step.

  • Check whether the combination of associated vertices found in step 2c satisfies the condition.

    • If the condition is met, set "cycleExists" to true and break out of the loop.

  • After completing the cycle, check the value of "cycleExists".

    • If "cycleExists" is true, then there is a cycle of length 3 in the graph that satisfies the given condition.

    • If "cycleExists" is wrong, no such cycle exists.

  • Output results.

  • This calculation repeats the vertices of the graph, analyzes their adjacent vertices, and checks whether any matches of adjacent vertices form a cycle of length 3 that satisfies the given condition.

    李>

Example

#include <iostream>
#include <vector>

using namespace std;

bool checkCycle(vector<vector<int>>& graph, int v, vector<bool>& visited, int parent, int condition) {
    visited[v] = true;

    for (int u : graph[v]) {
        if (!visited[u]) {
            visited[u] = true;

            for (int w : graph[u]) {
                if (visited[w] && w != parent && condition == graph[v][u] + graph[u][w]) {
                    return true;
                }
            }

            visited[u] = false;
        }
    }

    return false;
}

bool hasCycleOfLength3(vector<vector<int>>& graph, int condition) {
    int numVertices = graph.size();
    vector<bool> visited(numVertices, false);

    for (int v = 0; v < numVertices; v++) {
        visited[v] = true;

        for (int u : graph[v]) {
            if (checkCycle(graph, u, visited, v, condition)) {
                return true;
            }
        }

        visited[v] = false;
    }

    return false;
}

int main() {
    int numVertices, numEdges;
    cout << "Enter the number of vertices and edges: ";
    cin >> numVertices >> numEdges;

    vector<vector<int>> graph(numVertices);

    cout << "Enter the connections between vertices (u, v) and their corresponding weights: " << endl;
    for (int i = 0; i < numEdges; i++) {
        int u, v, weight;
        cin >> u >> v >> weight;

        graph[u].push_back(v);
        graph[v].push_back(u);

        // Store the weight/condition between u and v
        graph[u][v] = weight;
        graph[v][u] = weight;
    }

    int condition;
    cout << "Enter the condition to be satisfied: ";
    cin >> condition;

    if (hasCycleOfLength3(graph, condition)) {
        cout << "Cycle of length 3 satisfying the condition exists." << endl;
    } else {
        cout << "Cycle of length 3 satisfying the condition does not exist." << endl;
    }

    return 0;
}


Copy after login

Output

Enter the number of vertices and edges:  
Copy after login

Adjacency list method

Adjacent list methods can be information structures used to talk to the diagram. In this approach, each vertex of the graph is associated with a list containing all its adjacent vertices. To check if there is a cycle of length 3 in the graph that satisfies the given condition, we will iterate over each vertex and its neighboring vertices. For each adjacent vertex, we check if it contains an adjacent vertex in common with the current vertex. If such a common vertex exists, then a ring of length 3 is found. This approach guarantees efficient investigation of the graph by storing essential data about almost all vertices in the infectious list and their associations.

algorithm

  • Make an infectious list that talks to the graph, where each vertex contains a list of its neighboring vertices.

  • Iterate over each vertex in the graph.

  • For each vertex, repeat its adjacent vertices.

  • For each adjacent vertex, emphasize its adjacent vertices (except the current vertex).

  • Check whether there is a common vertex between the current vertex and the adjacent vertex of the adjacent vertex.

  • If a common vertex is found, a cycle of length 3 exists. Return true.

  • If no ring of length 3 is found, return false.

Example

#include <iostream>
#include <vector>
#include <unordered_set>

using namespace std;

bool hasCycleOfLength3(vector<vector<int>>& graph) {
    int n = graph.size();
    
    for (int u = 0; u < n; ++u) {
        unordered_set<int> adjSet(graph[u].begin(), graph[u].end());

        for (int v : graph[u]) {
            for (int w : graph[v]) {
                if (w != u && adjSet.count(w) > 0) {
                    return true; // Cycle of length 3 found
                }
            }
        }
    }

    return false; // No cycle of length 3 found
}

int main() {
    // Create the graph as an adjacency list
    vector<vector<int>> graph = {
        {1, 2},
        {0, 2},
        {0, 1, 3},
        {2, 4},
        {3}
    };

    // Check if a cycle of length 3 exists
    bool cycleExists = hasCycleOfLength3(graph);

    // Print the result
    if (cycleExists) {
        cout << "A cycle of length 3 exists in the graph." << endl;
    } else {
        cout << "No cycle of length 3 exists in the graph." << endl;
    }

    return 0;
}
Copy after login

Output

A cycle of length 3 exists in the graph.
Copy after login

in conclusion

This article examines methods for checking whether there is a loop of length 3 in a graph that satisfies a given condition. It illustrates two approaches, specifically the contagious frame approach and the contagious list approach. This article traces the calculation process and gives bits of C code for both methods. The contagious network approach involves emphasizing each vertex and its neighboring vertices to identify cycles of length 3 that satisfy the condition. The contagious list method exploits information structures that talk to the graph and examines common vertices between adjacent vertices to determine the proximity of cycles.

The above is the detailed content of Check if there is a cycle of length 3 in the graph that satisfies the given condition. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

C language data structure: data representation and operation of trees and graphs C language data structure: data representation and operation of trees and graphs Apr 04, 2025 am 11:18 AM

C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

The truth behind the C language file operation problem The truth behind the C language file operation problem Apr 04, 2025 am 11:24 AM

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

How to calculate c-subscript 3 subscript 5 c-subscript 3 subscript 5 algorithm tutorial How to calculate c-subscript 3 subscript 5 c-subscript 3 subscript 5 algorithm tutorial Apr 03, 2025 pm 10:33 PM

The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.

What are the basic requirements for c language functions What are the basic requirements for c language functions Apr 03, 2025 pm 10:06 PM

C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values ​​to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.

Function name definition in c language Function name definition in c language Apr 03, 2025 pm 10:03 PM

The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.

Concept of c language function Concept of c language function Apr 03, 2025 pm 10:09 PM

C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.

C language multithreaded programming: a beginner's guide and troubleshooting C language multithreaded programming: a beginner's guide and troubleshooting Apr 04, 2025 am 10:15 AM

C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.

CS-Week 3 CS-Week 3 Apr 04, 2025 am 06:06 AM

Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i

See all articles