Scribd
Upload
45 views1 page

Week 15 Reflection

Uploaded by

Carlo Rosallosa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
45 views1 page

Week 15 Reflection

Uploaded by

Carlo Rosallosa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Graph algorithms are a collection of techniques and methods for solving graph-

related problems. A graph is a data structure made up of vertices or nodes connected


by edges or arcs. Graph algorithms can be used to solve a variety of problems, such as
determining the shortest path between two nodes, detecting cycles, and determining the
maximum flow in a network.

A graph is a data structure in graph theory and algorithm that consists of a set of
vertices (or nodes) connected by edges (or arcs). Graphs are classified into two types:
directed graphs (also known as digraphs) and undirected graphs. An undirected graph
has edges that have no direction. In other words, if an edge connects vertex A to vertex
B, it also connects vertex B to vertex A. The edges of an undirected graph represent
symmetric relationships between nodes. A social network, for example, can be
represented as an undirected graph, with nodes representing people and edges
representing friendships. A directed graph, on the other hand, is one in which the edges
have a direction. That is, if an edge connects vertex A to vertex B, it does not always
connect vertex B to vertex A. The edges of a directed graph represent asymmetric
relationships between nodes. A transportation network, for example, can be represented
as a directed graph, with nodes representing cities and edges representing one-way
roads.

In summary, there are two types of graphs used in graph theory and algorithms,
and the type of graph used depends on the problem being solved.

You might also like