Please enable JavaScript.
Coggle requires JavaScript to display documents.
Methodologies – "Evaluating the Influence of Graph Density on…
Methodologies – "Evaluating the Influence of Graph Density on Shortest Path Algorithms"
Methodology/technique used 🔎
Adjacency matrix vs list
Compared
iterations, comparisons
Weaknesses of the approach :warning:
Synthetic only
, no real data
Operation counts
, not runtime
Single algorithm
type only
Dataset/model/algorithm selected 📈
5 size groups
(100–500)
19 density levels
(5%–95%)
95 generated graphs
total
Strengths of the approach 💪
Wide density
range tested
Rigorous
controlled design
Hypothesis
disproved
by data
Future scope identified 🚀
82% density
= crossover point
Adaptive
data structure selection
Optimize
mobile pathfinding