📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

    Question

    A graph where edges have a direction (e.g., from A to B,

    but not necessarily B to A) is called a:
    A Undirected graph Correct Answer Incorrect Answer
    B Complete graph Correct Answer Incorrect Answer
    C Directed graph Correct Answer Incorrect Answer
    D Weighted graph Correct Answer Incorrect Answer
    E Cyclic graph Correct Answer Incorrect Answer

    Solution

    Directed graph

    Practice Next
    More Data Structure Questions
    ask-question