I don't mean traversal ones like bfs and dfs but ones like matching, shortest path etc. I suppose algo will be developed only when a problem is found that's not solvable with preexisting algo but I am really curious. Reading graph chapters in CS textbooks looks like reading Newtonian physics where everything is settled.