amand26's blog

graph query
By amand26, history, 8 years ago, In English

I am a beginner and want to start to learn graphs.Is it necessary to do trees before doing graphs.what are the requirements to study graphs and trees.

  • Vote: I like it
  • +1
  • Vote: I do not like it

Comments Comments (7)
| Write comment?
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by amand26 (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Why downvotes

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

You are absolutely right

→ Reply
»
8 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Try solving problems in order from easiest, from CF archive. If you don't know a topic, google it, look at editorial or codes.

→ Reply
»
8 years ago, # |
← Rev. 3   Vote: I like it +6 Vote: I do not like it

Study some graph theory, learn some theoretical stuff to kick off, learn some formulas, theorems and why they work (formal proofs). Then proceed to study algorithms and it will be a walk in the park. You should start with traversal algorithms (Depth First Search, Breadth First Search) which are the easiest and most essential because every algorithm is some kind of traversal in a graph. Then you can study the mainstream problems which include Shortest Paths, Minimal Spanning Trees, (Strong) Connectivity Problems, problems with optimal substructure (solvable by backtracking or dynamic programming). I don't think there's any optimal order to study these topics, but each one of them is important and also there are many many others, there's always something new to learn :)

→ Reply
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks everybody.Very helpful.

→ Reply
»
8 years ago, # |
  Vote: I like it +2 Vote: I do not like it

ggmu

→ Reply