DirectedGraph::inDegree

Function


int inDegree(const T& x);


Get the in degree of a specified vertex.

Parameters

x is label of specified vertex.

Return value

Return in degree of specified vertex.

Example

#include "HKUAL_graph.h"
#include <iostream>
using namespace std;
using namespace HKUAL;

int main(){
    DirectedGraph<string> g;
    g.addVertex("A");
    g.addVertex("B");
    g.addVertex("C");
    g.addEdge("A", "B");
    g.addEdge("A", "C");
 
    cout << g.inDegree("A") << endl;
    cout << g.inDegree("B") << endl;
    return 0;
}

Output

0
1

Time Complexity

, for is number of vertices.

© The University of Hong Kong Algorithms Library - hkual@cs.hku.hk