algorithm - A graph with n nodes and n vertices can contain just one cycle -
if graph unweighted g
have same number of nodes
, edges
, correct assume graph g
contain 1 cycle ? can proved ?
edit: , node conected
if , if there 1 component in graph. in other words, if each node, there path node in graph, can assume there 1 cycle.
Comments
Post a Comment