search
HomeBackend DevelopmentC++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

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;
}


Output

Enter the number of vertices and edges:  

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;
}

Output

A cycle of length 3 exists in the graph.

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
This article is reproduced at:tutorialspoint. If there is any infringement, please contact admin@php.cn delete
The Future of C  : Adaptations and InnovationsThe Future of C : Adaptations and InnovationsApr 27, 2025 am 12:25 AM

The future of C will focus on parallel computing, security, modularization and AI/machine learning: 1) Parallel computing will be enhanced through features such as coroutines; 2) Security will be improved through stricter type checking and memory management mechanisms; 3) Modulation will simplify code organization and compilation; 4) AI and machine learning will prompt C to adapt to new needs, such as numerical computing and GPU programming support.

The Longevity of C  : Examining Its Current StatusThe Longevity of C : Examining Its Current StatusApr 26, 2025 am 12:02 AM

C is still important in modern programming because of its efficient, flexible and powerful nature. 1)C supports object-oriented programming, suitable for system programming, game development and embedded systems. 2) Polymorphism is the highlight of C, allowing the call to derived class methods through base class pointers or references to enhance the flexibility and scalability of the code.

C# vs. C   Performance: Benchmarking and ConsiderationsC# vs. C Performance: Benchmarking and ConsiderationsApr 25, 2025 am 12:25 AM

The performance differences between C# and C are mainly reflected in execution speed and resource management: 1) C usually performs better in numerical calculations and string operations because it is closer to hardware and has no additional overhead such as garbage collection; 2) C# is more concise in multi-threaded programming, but its performance is slightly inferior to C; 3) Which language to choose should be determined based on project requirements and team technology stack.

C  : Is It Dying or Simply Evolving?C : Is It Dying or Simply Evolving?Apr 24, 2025 am 12:13 AM

C isnotdying;it'sevolving.1)C remainsrelevantduetoitsversatilityandefficiencyinperformance-criticalapplications.2)Thelanguageiscontinuouslyupdated,withC 20introducingfeatureslikemodulesandcoroutinestoimproveusabilityandperformance.3)Despitechallen

C   in the Modern World: Applications and IndustriesC in the Modern World: Applications and IndustriesApr 23, 2025 am 12:10 AM

C is widely used and important in the modern world. 1) In game development, C is widely used for its high performance and polymorphism, such as UnrealEngine and Unity. 2) In financial trading systems, C's low latency and high throughput make it the first choice, suitable for high-frequency trading and real-time data analysis.

C   XML Libraries: Comparing and Contrasting OptionsC XML Libraries: Comparing and Contrasting OptionsApr 22, 2025 am 12:05 AM

There are four commonly used XML libraries in C: TinyXML-2, PugiXML, Xerces-C, and RapidXML. 1.TinyXML-2 is suitable for environments with limited resources, lightweight but limited functions. 2. PugiXML is fast and supports XPath query, suitable for complex XML structures. 3.Xerces-C is powerful, supports DOM and SAX resolution, and is suitable for complex processing. 4. RapidXML focuses on performance and parses extremely fast, but does not support XPath queries.

C   and XML: Exploring the Relationship and SupportC and XML: Exploring the Relationship and SupportApr 21, 2025 am 12:02 AM

C interacts with XML through third-party libraries (such as TinyXML, Pugixml, Xerces-C). 1) Use the library to parse XML files and convert them into C-processable data structures. 2) When generating XML, convert the C data structure to XML format. 3) In practical applications, XML is often used for configuration files and data exchange to improve development efficiency.

C# vs. C  : Understanding the Key Differences and SimilaritiesC# vs. C : Understanding the Key Differences and SimilaritiesApr 20, 2025 am 12:03 AM

The main differences between C# and C are syntax, performance and application scenarios. 1) The C# syntax is more concise, supports garbage collection, and is suitable for .NET framework development. 2) C has higher performance and requires manual memory management, which is often used in system programming and game development.

See all articles

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

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

DVWA

DVWA

Damn Vulnerable Web App (DVWA) is a PHP/MySQL web application that is very vulnerable. Its main goals are to be an aid for security professionals to test their skills and tools in a legal environment, to help web developers better understand the process of securing web applications, and to help teachers/students teach/learn in a classroom environment Web application security. The goal of DVWA is to practice some of the most common web vulnerabilities through a simple and straightforward interface, with varying degrees of difficulty. Please note that this software

EditPlus Chinese cracked version

EditPlus Chinese cracked version

Small size, syntax highlighting, does not support code prompt function

SecLists

SecLists

SecLists is the ultimate security tester's companion. It is a collection of various types of lists that are frequently used during security assessments, all in one place. SecLists helps make security testing more efficient and productive by conveniently providing all the lists a security tester might need. List types include usernames, passwords, URLs, fuzzing payloads, sensitive data patterns, web shells, and more. The tester can simply pull this repository onto a new test machine and he will have access to every type of list he needs.

WebStorm Mac version

WebStorm Mac version

Useful JavaScript development tools