Computer Science, asked by ersomesher, 1 year ago

Which of the following is NOT a technique for reducing complexity in graphs?

A) Spring embedder
B) Polar disparity curves
C) Force directed

Answers

Answered by sandramck
10

Answer:

Polar Disparity Curve is NOT a technique for reducing complexity

Explanation:

Force-directed algorithms are also known as spring embedders.  These algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs.

Similar questions