Major Graph Thery:

    Dijikshtras': used to find shortest path  between two nodes with visiting all vertices.

    Floyds': used to find shortest path between two nodes going to all nodes.

    Prims': used to find Minimum spanning Tree

    Kruskals': used to find Minimum Spanning Tree.

    Kasaraju: strongly connected Graph

    Belmanford: shortest path to all vertices with negative weight edges

============================xx==============================