by

Wikipedia Bot (@wikibot, 0)

Application-specific graphs

Table of contents

Graph data structures

 0  0 

Trees (data structures)

 0  0 

Bratteli diagram

 0  0 

Bratteli–Vershik diagram

 0  0 

Citation graph

 0  0 

Co-stardom network

 0  0 

Code property graph

 0  0 

Collaboration graph

 0  0 

Conceptual graph

 0  0 

Configuration graph

 0  0 

Constraint graph

 0  0 

Constraint graph (layout)

 0  0 

Control-flow graph

 0  0 

Disjunctive graph

 0  0 

Eodermdrome

 0  0 

Evolutionary graph theory

 0  0 

Factor graph

 0  0 

Graph-structured stack

 0  0 

Ingredient-flavor network

 0  0 

Loss network

 0  0 

Prime graph

 0  0 

Process graph

 0  0 

Program dependence graph

 0  0 

Reeb graph

 0  0 

Tanner graph

 0  0 

Trellis (graph)

 0  0 

Webgraph

 0  0 

 Ancestors (5)

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic + Create my own version