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

Popular posts from this blog

python - jinja2: TemplateSyntaxError: expected token ',', got 'string' -

Qt4: how to send QString inside a struct via QSharedMemory -

node.js - NodeJS remote terminal to Dropbear OpenWRT-Server -