NOIP Program Master Co, Ltd
Production Pack Guide
Produced by pseudo-AIcoder-7a7968-58

sp.h
Step 2 : Function Copying
  1. Copy the code newint.h from line 8 to 75 to Label 1

Part 1 : Single Source Shortest Path Algorithm

Here are some algorithms solving above problems.

You can use them for it.

Step 3 : Data Preparing

Use type adjacent_table to storage a graph.

  • Function resize()

    Use the function the set the size of the graph.

    gp.resize(V);
  • operator=

    Use operator= to set the value of a directed edge.

    gp[u][v] = w;
Part 2 : Multi Source Shortest Path Algorithm

Here are some algorithms solving above problems.

You can use them for it.

Step 3 : Data Preparing

Use type adjacent_matrix to storage a graph.

  • Function resize()

    Use the function the set the size of the graph.

    gp.resize(V);
    for (int i=0;i<V;i++) gp[i].resize(V);
  • operator=

    Use operator= to set the value of a directed edge.

    gp[u][v] = w;
Want more? Go back to the Part 2 : Search Guide to find what do you still need.
Have some problems? Turn to the Part 4 : Exception to solve them.