Revolutionary knowledge-based programming language.
The preeminent environment for any technical workflows.
Semantic framework for real-world data.
Central infrastructure for Wolfram's cloud products & services.
Software engine implementing the Wolfram Language.
Instant deployment across cloud, desktop, mobile, and more.
Technology-enabling science of the computational universe.
Knowledge-based, broadly deployed natural language.
Curated computable knowledge powering Wolfram|Alpha.
yields True if the graph g has edges tagged and False otherwise.
Test whether a graph is tagged:
EdgeTaggedGraphQ gives False for inputs that are not tagged graphs:
EdgeTaggedGraphQ works with undirected graphs:
EdgeTaggedGraphQ gives False for anything that is not a tagged graph:
EdgeTaggedGraphQ works with large graphs:
IndexEdgeTaggedGraph generates tagged graphs:
Use UndirectedEdge to construct undirected tagged graphs:
Use DirectedEdge to construct directed tagged graphs:
A tagged graph can have self-loops:
EdgeTags gives the list of tags of a graph:
EdgeTaggedGraph IndexEdgeTaggedGraph EdgeTags UndirectedEdge DirectedEdge