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