Graph Processing Algorithm

From GM-RKB

Revision as of 16:29, 18 March 2021 by Gmelli (talk | contribs) (Text replacement - "---- ---- [[Category" to "---- ---- __NOTOC__ [[Category")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

A Graph Processing Algorithm is a processing algorithm that can process a graph data structure.

Context:
- It can be applied by a Graph Processing System, such as a graph processing library.
- …
Example(s):
- a Optimal-Path Finding Algorithm.
- …
Counter-Example(s):
- a Numerical Algorithm.
See: Dijkstra Algorithm.

Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Graph_Processing_Algorithm&oldid=663202"

Concept