## Discussion Forum

Que. | State True of False.
i) Network is a graph that has weights or costs associated with it. ii) An undirected graph which contains no cycles is called a forest. iii) A graph is said to be complete if there is no edge between every pair of vertices. |

a. | True, False, True |

b. | True, True, False |

c. | True, True, True |

d. | False, True, True |

Answer:True, True, False |