Please read the new rule regarding the restriction on the use of AI tools. ×

duongquanghai08's blog

shortest single cycle in an unweighted graph n<=1e6

By duongquanghai08, history, 9 days ago, In English

shortest single cycle in an unweighted graph n<=1e6

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
9 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Is it a directed or an undirected graph?

If it's an undirected graph, you can construct a DFS Tree, and every back-edge defines a cycle

→ Reply
  • »
    »
    9 days ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    Shortest cycle length here $$$= 3$$$, not defined by only one back edge

    → Reply
»
9 days ago, # |
← Rev. 2   Vote: I like it +5 Vote: I do not like it

I think this can help you

→ Reply
»
4 days ago, # |
  Vote: I like it 0 Vote: I do not like it

orz dequy hai

→ Reply
  • »
    »
    2 hours ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    dijme pupil rack

    → Reply
»
4 days ago, # |
  Vote: I like it +20 Vote: I do not like it

It can't be solved in better than $$$O(nm)$$$, where $$$m$$$ is the number of edges.

https://en.m.wikipedia.org/wiki/Girth_(graph_theory)#Computation

→ Reply