Which of the following is not a type of graph in computer science?ans.directed graphundirected graphbar graphweighted graph Previous Marked for Review Next

In computer science, various types of graphs are utilized for different purposes. Let's analyze the options provided:

1. Directed Graph: A graph where edges have a direction, indicating a one-way relationship between nodes.

2. Undirected Graph: A graph where edges do not have a direction, signifying a bidirectional relationship between nodes.

3. Bar Graph: A type of chart used to represent categorical data with rectangular bars. While commonly used in data visualization, it is not a type of graph in the context of graph theory relevant to computer science.

4. Weighted Graph: A graph where edges have weights assigned to them, representing costs or distances.

Conclusion

Among the options given, the Bar Graph is not a type of graph in computer science in terms of graph structures used in algorithms and data structures. The other three options—directed graph, undirected graph, and weighted graph—are all specific types of graphs employed in computer science.