1:00
Click the first and last characters of the items you find.
en
WO
31
graph : Defined by finite sets: V = a set of vertices, and E = a set of edges.
edge : Connects two vertices.
circles : Vertices are represented with ______.
Lines : Edges are represented with _____ between vertices.
Label : Vertices are denoted with a _____.
node : Another name for a vertex.
Weighted : A graph in which edges have some kind of value associated with them.
Undirected : A graph in which each edge can be traversed in either direction.
directed : A digraph has ________ edges.
digraph : A graph in which each edge is an ordered pair, ex: (D,C) ∈ E, (C,D) ∉ E
Adjacent : Two vertices are ________ if they are endpoints of the same edge.
Endpoints : The vertices connected to an edge.
Incident : An edge is ________ on a vertex if the vertex is an endpoint of the edge.
Degree : The number of incident edges on a vertex is the vertex’s ______.
Indegree : The number of edges pointing to a node.
Outdegree : The number of edges pointing from a node.
Selfloop : An edge with the endpoints being the same vertex.
path : A sequence of vertices in which each pair of successive vertices is connected by an edge.
cycle : A path that starts and ends on the same vertex.
Simple : A path that does not cross itself – no vertex is repeated – is called ______.
Length : The number of edges in a path or the sum of the weights of its edges.
Acyclic : A graph that doesn’t contain any cycles.
Complete : A graph in which each vertex is connected to each of the others (with one edge between each pair of vertices) is _______.
Connected : A graph in which there is a path connecting every pair of vertices is ________.
Strongly connected : A directed graph in which every pair of vertices has a path between them in both directions. (2 words)
tree : An undirected, connected graph with no cycles.
Spanning tree : A connected subgraph which contains all vertices and is a tree. (2 words)
Adjacency list : A list data structure that is used to represent graphs. Each node has a list of nodes that it is connected to. (2 words)
Adjacency matrix : A 2D array containing weights on edges. It has a row for each vertex and a column for each vertex. (2 words)
Isolated : A vertex of degree zero (no edges connected).
Chromatic number : The least number of colors it takes to color its vertices so that adjacent vertices have different colors. (2 words)
X | S | J | F | Z | M | D | J | J | Q | W | T | R | E | E | A | C | U | U | N | G | H | X | Y | N | T | I | S | N |
H | R | C | C | L | J | L | I | T | O | A | R | E | D | G | G | F | S | E | L | D | W | S | M | R | H | A | F | I |
C | G | S | H | W | H | V | M | G | W | A | M | K | J | T | Z | G | R | H | E | L | J | A | X | D | Y | P | P | W |
Y | V | A | R | C | K | G | X | L | R | L | G | L | P | M | X | B | R | T | K | A | I | F | Y | D | W | N | H | E |
Q | B | C | O | Q | C | A | X | P | M | A | V | L | I | D | X | D | C | A | F | B | N | Z | A | F | Z | X | Q | I |
D | M | Y | M | P | E | A | L | N | E | A | P | H | T | I | V | E | O | D | H | E | C | R | J | J | N | Q | U | G |
L | K | C | A | V | W | C | S | U | R | F | R | H | R | F | R | G | J | L | R | L | I | G | B | Y | A | W | O | H |
Y | U | L | T | R | G | R | A | P | H | B | T | T | M | I | Z | R | D | F | S | A | D | Y | Y | J | L | S | Y | T |
S | L | I | I | W | X | A | B | S | A | I | A | F | D | S | H | E | Z | Q | G | U | E | V | N | Y | F | T | Z | E |
M | Q | C | C | M | D | G | T | R | P | M | N | R | C | Y | Z | E | R | U | G | P | N | H | U | N | R | R | X | D |
R | F | V | N | K | L | Q | M | J | Y | A | M | D | S | P | N | O | H | N | I | D | T | O | I | T | A | O | L | V |
L | X | V | U | Z | U | N | X | C | I | I | N | Z | E | E | F | O | U | G | Q | E | A | J | P | D | O | N | W | Y |
O | F | M | M | I | H | I | N | W | S | Q | S | N | S | G | L | B | K | T | D | Y | I | U | P | F | R | G | B | A |
G | A | Y | B | Q | R | E | J | D | C | H | P | O | I | F | R | F | K | N | D | S | Q | D | A | O | Z | L | Q | Q |
J | W | F | E | H | C | L | C | A | Q | H | Q | R | L | N | X | E | L | O | M | E | C | G | D | L | O | Y | G | E |
N | F | R | R | A | G | U | L | Q | S | M | A | E | T | A | G | Y | E | O | E | C | G | P | V | S | Z | C | P | I |
O | A | D | J | A | C | E | N | C | Y | L | I | S | T | T | T | T | P | N | O | Z | M | R | V | F | M | O | N | F |
D | O | D | D | X | M | D | H | H | C | M | C | H | N | S | Q | E | R | M | B | P | A | J | E | A | S | N | M | S |
E | A | L | Y | S | N | G | F | X | M | W | T | E | M | C | U | N | D | E | G | L | L | G | U | E | T | N | W | I |
W | L | U | U | P | U | E | Y | C | R | T | C | O | C | V | M | A | R | Z | E | C | I | K | I | S | T | E | Q | M |
K | O | E | F | M | C | R | Q | I | A | A | W | S | T | O | F | S | K | A | N | O | N | A | J | Y | B | C | F | P |
C | O | N | N | E | C | T | E | D | J | A | E | Q | L | G | M | L | E | W | A | O | E | C | B | R | M | T | D | L |
Z | Y | D | B | G | K | B | N | D | P | L | M | Q | K | F | C | P | W | D | O | X | S | D | A | N | R | E | P | E |
C | X | D | X | Z | T | K | A | T | C | E | G | G | B | O | F | R | L | X | V | B | C | M | Y | Z | O | D | G | V |
Q | B | P | I | N | A | H | K | R | P | U | N | D | I | R | E | C | T | E | D | F | H | F | J | W | C | C | R | N |
I | O | H | U | S | X | Q | I | Z | T | L | A | X | M | B | N | Y | V | W | T | T | I | U | Q | J | P | C | Z | L |
J | L | C | K | T | X | C | B | G | I | X | I | L | L | U | E | H | B | Y | A | E | E | Q | R | M | T | O | S | W |
M | Q | I | Q | V | B | A | W | K | P | H | D | B | R | K | D | R | K | P | E | V | V | Y | U | H | H | E | P | W |
G | J | A | E | E | N | D | P | O | I | N | T | S | R | O | C | K | F | X | C | Y | C | L | E | M | A | K | S | Y |
- A 2D array containing weights on edges. It has a row for each vertex and a column for each vertex. (2 words)
- A connected subgraph which contains all vertices and is a tree. (2 words)
- A digraph has ________ edges.
- A directed graph in which every pair of vertices has a path between them in both directions. (2 words)
- A graph in which each edge can be traversed in either direction.
- A graph in which each edge is an ordered pair, ex: (D,C) ∈ E, (C,D) ∉ E
- A graph in which each vertex is connected to each of the others (with one edge between each pair of vertices) is _______.
- A graph in which edges have some kind of value associated with them.
- A graph in which there is a path connecting every pair of vertices is ________.
- A graph that doesn’t contain any cycles.
- A list data structure that is used to represent graphs. Each node has a list of nodes that it is connected to. (2 words)
- A path that does not cross itself – no vertex is repeated – is called ______.
- A path that starts and ends on the same vertex.
- A sequence of vertices in which each pair of successive vertices is connected by an edge.
- A vertex of degree zero (no edges connected).
- An edge is ________ on a vertex if the vertex is an endpoint of the edge.
| - An edge with the endpoints being the same vertex.
- An undirected, connected graph with no cycles.
- Another name for a vertex.
- Connects two vertices.
- Defined by finite sets: V = a set of vertices, and E = a set of edges.
- Edges are represented with _____ between vertices.
- The least number of colors it takes to color its vertices so that adjacent vertices have different colors. (2 words)
- The number of edges in a path or the sum of the weights of its edges.
- The number of edges pointing from a node.
- The number of edges pointing to a node.
- The number of incident edges on a vertex is the vertex’s ______.
- The vertices connected to an edge.
- Two vertices are ________ if they are endpoints of the same edge.
- Vertices are denoted with a _____.
- Vertices are represented with ______.
|
© 2013
PuzzleFast.com, Noncommercial Use Only
X | S | J | F | Z | M | D | J | J | Q | W | T | R | E | E | A | C | U | U | N | G | H | X | Y | N | T | I | S | N |
H | R | C | C | L | J | L | I | T | O | A | R | E | D | G | G | F | S | E | L | D | W | S | M | R | H | A | F | I |
C | G | S | H | W | H | V | M | G | W | A | M | K | J | T | Z | G | R | H | E | L | J | A | X | D | Y | P | P | W |
Y | V | A | R | C | K | G | X | L | R | L | G | L | P | M | X | B | R | T | K | A | I | F | Y | D | W | N | H | E |
Q | B | C | O | Q | C | A | X | P | M | A | V | L | I | D | X | D | C | A | F | B | N | Z | A | F | Z | X | Q | I |
D | M | Y | M | P | E | A | L | N | E | A | P | H | T | I | V | E | O | D | H | E | C | R | J | J | N | Q | U | G |
L | K | C | A | V | W | C | S | U | R | F | R | H | R | F | R | G | J | L | R | L | I | G | B | Y | A | W | O | H |
Y | U | L | T | R | G | R | A | P | H | B | T | T | M | I | Z | R | D | F | S | A | D | Y | Y | J | L | S | Y | T |
S | L | I | I | W | X | A | B | S | A | I | A | F | D | S | H | E | Z | Q | G | U | E | V | N | Y | F | T | Z | E |
M | Q | C | C | M | D | G | T | R | P | M | N | R | C | Y | Z | E | R | U | G | P | N | H | U | N | R | R | X | D |
R | F | V | N | K | L | Q | M | J | Y | A | M | D | S | P | N | O | H | N | I | D | T | O | I | T | A | O | L | V |
L | X | V | U | Z | U | N | X | C | I | I | N | Z | E | E | F | O | U | G | Q | E | A | J | P | D | O | N | W | Y |
O | F | M | M | I | H | I | N | W | S | Q | S | N | S | G | L | B | K | T | D | Y | I | U | P | F | R | G | B | A |
G | A | Y | B | Q | R | E | J | D | C | H | P | O | I | F | R | F | K | N | D | S | Q | D | A | O | Z | L | Q | Q |
J | W | F | E | H | C | L | C | A | Q | H | Q | R | L | N | X | E | L | O | M | E | C | G | D | L | O | Y | G | E |
N | F | R | R | A | G | U | L | Q | S | M | A | E | T | A | G | Y | E | O | E | C | G | P | V | S | Z | C | P | I |
O | A | D | J | A | C | E | N | C | Y | L | I | S | T | T | T | T | P | N | O | Z | M | R | V | F | M | O | N | F |
D | O | D | D | X | M | D | H | H | C | M | C | H | N | S | Q | E | R | M | B | P | A | J | E | A | S | N | M | S |
E | A | L | Y | S | N | G | F | X | M | W | T | E | M | C | U | N | D | E | G | L | L | G | U | E | T | N | W | I |
W | L | U | U | P | U | E | Y | C | R | T | C | O | C | V | M | A | R | Z | E | C | I | K | I | S | T | E | Q | M |
K | O | E | F | M | C | R | Q | I | A | A | W | S | T | O | F | S | K | A | N | O | N | A | J | Y | B | C | F | P |
C | O | N | N | E | C | T | E | D | J | A | E | Q | L | G | M | L | E | W | A | O | E | C | B | R | M | T | D | L |
Z | Y | D | B | G | K | B | N | D | P | L | M | Q | K | F | C | P | W | D | O | X | S | D | A | N | R | E | P | E |
C | X | D | X | Z | T | K | A | T | C | E | G | G | B | O | F | R | L | X | V | B | C | M | Y | Z | O | D | G | V |
Q | B | P | I | N | A | H | K | R | P | U | N | D | I | R | E | C | T | E | D | F | H | F | J | W | C | C | R | N |
I | O | H | U | S | X | Q | I | Z | T | L | A | X | M | B | N | Y | V | W | T | T | I | U | Q | J | P | C | Z | L |
J | L | C | K | T | X | C | B | G | I | X | I | L | L | U | E | H | B | Y | A | E | E | Q | R | M | T | O | S | W |
M | Q | I | Q | V | B | A | W | K | P | H | D | B | R | K | D | R | K | P | E | V | V | Y | U | H | H | E | P | W |
G | J | A | E | E | N | D | P | O | I | N | T | S | R | O | C | K | F | X | C | Y | C | L | E | M | A | K | S | Y |
- ADJACENCYMATRIX
- SPANNINGTREE
- DIRECTED
- STRONGLYCONNECTED
- UNDIRECTED
- DIGRAPH
- COMPLETE
- WEIGHTED
- CONNECTED
- ACYCLIC
- ADJACENCYLIST
- SIMPLE
- CYCLE
- PATH
- ISOLATED
- INCIDENT
| - SELFLOOP
- TREE
- NODE
- EDGE
- GRAPH
- LINES
- CHROMATICNUMBER
- LENGTH
- OUTDEGREE
- INDEGREE
- DEGREE
- ENDPOINTS
- ADJACENT
- LABEL
- CIRCLES
|
© 2013
PuzzleFast.com, Noncommercial Use Only