Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Trivial_Graph_Format> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- Trivial_Graph_Format abstract "Trivial Graph Format (TGF) is a simple text-based file format for describing graphs. It consists of a list of node definitions, which map node IDs to labels, followed by a list of edges, which specify node pairs and an optional edge label. Node IDs can be arbitrary identifiers, whereas labels for both nodes and edges are plain strings.The graph may be interpreted as a directed or undirected graph. For directed graphs, to specify the concept of bidirectionality in an edge, one may either specify two edges (forward and back), or differentiate the edge by means of a label. For more powerful specification of graphs, see the other graph file formats below.".
- Trivial_Graph_Format thumbnail Makefile-graph.png?width=300.
- Trivial_Graph_Format wikiPageExternalLink tgf.html.
- Trivial_Graph_Format wikiPageExternalLink graphml.graphdrawing.org.
- Trivial_Graph_Format wikiPageExternalLink graphviz.org.
- Trivial_Graph_Format wikiPageExternalLink TGF.html.
- Trivial_Graph_Format wikiPageExternalLink XGMML.
- Trivial_Graph_Format wikiPageExternalLink GXL.
- Trivial_Graph_Format wikiPageExternalLink GML.
- Trivial_Graph_Format wikiPageExternalLink tgf.html.
- Trivial_Graph_Format wikiPageID "19363223".
- Trivial_Graph_Format wikiPageRevisionID "587376261".
- Trivial_Graph_Format hasPhotoCollection Trivial_Graph_Format.
- Trivial_Graph_Format subject Category:Graph_description_languages.
- Trivial_Graph_Format type Abstraction100002137.
- Trivial_Graph_Format type Communication100033020.
- Trivial_Graph_Format type GraphDescriptionLanguages.
- Trivial_Graph_Format type Language106282651.
- Trivial_Graph_Format comment "Trivial Graph Format (TGF) is a simple text-based file format for describing graphs. It consists of a list of node definitions, which map node IDs to labels, followed by a list of edges, which specify node pairs and an optional edge label. Node IDs can be arbitrary identifiers, whereas labels for both nodes and edges are plain strings.The graph may be interpreted as a directed or undirected graph.".
- Trivial_Graph_Format label "Trivial Graph Format".
- Trivial_Graph_Format label "Trivial Graph Format".
- Trivial_Graph_Format sameAs m.04n6m9v.
- Trivial_Graph_Format sameAs Q4051789.
- Trivial_Graph_Format sameAs Q4051789.
- Trivial_Graph_Format sameAs Trivial_Graph_Format.
- Trivial_Graph_Format wasDerivedFrom Trivial_Graph_Format?oldid=587376261.
- Trivial_Graph_Format depiction Makefile-graph.png.
- Trivial_Graph_Format isPrimaryTopicOf Trivial_Graph_Format.
