Description: Empowering the central issue Digraph Problem Description: Let G = (V, E) is a directed graph Empowering, v is a G vertex, v is defined as the eccentricity: Max (w ∈ V, from w to v the shortest path length) G the minimum eccentricity of the vertex as the center of G. Try using Floyd algorithm for the design of a plan to empower the center to the algorithm.
To Search:
- [five] - A classic Gobang c++ Procedures, very go
- [floyd] - Floyd algorithm to calculate arbitrary s
File list (Check if you may need any files):
S030602102
..........\030602102.ppt
..........\center.c
Download