C++ connect edges with two nodes

To connect edges with two nodes in C++, you can use a Graph data structure and its corresponding methods. Here's an example code that demonstrates connecting edges with two nodes:

#include <iostream>
#include <vector>

using namespace std;

class Graph {
    int numNodes;
    vector<vector<int>> adjList;

public:
    Graph(int nodes) {
        numNodes = nodes;
        adjList.resize(nodes);
    }

    void addEdge(int src, int dest) {
        adjList[src].push_back(dest);
        adjList[dest].push_back(src);
    }

    void printGraph() {
        for (int i = 0; i < numNodes; ++i) {
            cout << "Node " << i << " is connected to: ";
            for (int j : adjList[i]) {
                cout << j << " ";
            }
            cout << endl;
        }
    }
};

int main() {
    Graph graph(5);  // Create a graph with 5 nodes

    // Add edges between nodes
    graph.addEdge(0, 1);
    graph.addEdge(0, 2);
    graph.addEdge(1, 2);
    graph.addEdge(2, 3);
    graph.addEdge(3, 4);

    // Print the graph
    graph.printGraph();

    return 0;
}

In the above code, we define a Graph class that has an adjacency list to store the connections between nodes. The addEdge method takes two nodes (source and destination) and adds an edge between them by updating the adjacency list. The printGraph method prints the connections for each node.

In the main function, we create a Graph object with 5 nodes and add edges between them using the addEdge method. Finally, we print the graph using the printGraph method