Graph Processing Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "---- ---- [[Category" to "---- ---- __NOTOC__ [[Category") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 9: | Line 9: | ||
** a [[Numerical Algorithm]]. | ** a [[Numerical Algorithm]]. | ||
* <B>See:</B> [[Dijkstra Algorithm]]. | * <B>See:</B> [[Dijkstra Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
Revision as of 17:03, 28 June 2021
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):
- Counter-Example(s):
- See: Dijkstra Algorithm.