[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]

# is_sub_graph(+SubGraph, +SuperGraph)

Succeeds iff SubGraph is a subgraph of SuperGraph

SubGraph
  a graph structure
SuperGraph
  a graph structure

## Description

Tests whether SubGraph is a (non-strict) subgraph of SuperGraph. This is the case when the nodes and edges in SubGraph are a subset of the nodes and edges of SuperGraph. Note that nodes are considered identical when they have the same node numbers (rather than the same node names - node name information is ignored by this predicate.).

### Modes and Determinism

- is_sub_graph(+, +) is semidet

### Fail Conditions

SubGraph is not a subgraph of SuperGraph

## See Also

make_sub_graph / 3