ACM's Graph Theory

 

Experimental data: 

you dege [ 5 ] [ 5 ] = { 
    { 0 , 9 , 6 , - 1 , - 1 }, 
    { - 1 , 0 , 4 , 5 , - 1 }, 
    { - 1 , - 1 , 0 , - 1 , 7 }, 
    { 3 , - 1 , - 1 , 0 , - 1 }, 
    { - 1 , -1,-1, 8, 0} };

 

• DFS depth-first search mark

　　aa

 

• No map to find bridge

 

• Undirected graph of communication

 

• Maximum clique problem

 

• Euler path

 

• Dijkstra array realization

 

• Dijkstra
• Single-source shortest BellmanFord