Graph Processing Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - ". ----" to ". ----") |
m (Text replacement - "__NOTOC__ " to "__NOTOC__ ") |
||
| Line 14: | Line 14: | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Concept]] | [[Category:Concept]] | ||
Latest revision as of 02:42, 6 January 2023
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.