Difference between revisions of "BFS, Python, NetworkX"

From Algowiki
Jump to navigation Jump to search
[checked revision][checked revision]
(Created page with "Primary author of this description: I.V.Afanasyev. == Software implementation of the algorithm: Python, NetworkX == The <code>[http://network...")
 
Line 4: Line 4:
  
 
The <code>[http://networkx.github.io/documentation/networkx-1.9.1/reference/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html bfs_edges]</code>).
 
The <code>[http://networkx.github.io/documentation/networkx-1.9.1/reference/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html bfs_edges]</code>).
 
=== Implementation peculiarities of the serial algorithm ===
 
  
 
=== Locality of data and computations ===
 
=== Locality of data and computations ===
 
==== Locality of implementation ====
 
==== Locality of implementation ====
 
===== Structure of memory access and a qualitative estimation of locality =====
 
===== Structure of memory access and a qualitative estimation of locality =====
 
 
===== Quantitative estimation of locality =====
 
===== Quantitative estimation of locality =====
 
=== Possible methods and considerations for parallel implementation of the algorithm ===
 
  
 
=== Scalability of the algorithm and its implementations ===
 
=== Scalability of the algorithm and its implementations ===
Line 20: Line 15:
  
 
=== Dynamic characteristics and efficiency of the algorithm implementation ===
 
=== Dynamic characteristics and efficiency of the algorithm implementation ===
=== Conclusions for different classes of computer architecture ===
+
=== Run results ===
  
 
[[Category:Articles in progress]]
 
[[Category:Articles in progress]]
  
 
[[Ru:Python, NetworkX]]
 
[[Ru:Python, NetworkX]]

Revision as of 16:12, 28 June 2022

Primary author of this description: I.V.Afanasyev.

1 Software implementation of the algorithm: Python, NetworkX

The bfs_edges).

1.1 Locality of data and computations

1.1.1 Locality of implementation

1.1.1.1 Structure of memory access and a qualitative estimation of locality
1.1.1.2 Quantitative estimation of locality

1.2 Scalability of the algorithm and its implementations

1.2.1 Scalability of the algorithm

1.2.2 Scalability of of the algorithm implementation

1.3 Dynamic characteristics and efficiency of the algorithm implementation

1.4 Run results