Adjacency Matrix
Adjacency Matrix When you study graphs, youโll often hear people say things like โWe need to store the connections between
Continue reading
Category: IT
Sequential Representation of Graphs
Sequential Representation of Graphs When you hear the word graph, you might imagine a bunch of points connected with lines
Continue reading
Hamiltonian Paths and Hamiltonian Circuits
๐ผ What Is a Hamiltonian Path? A Hamiltonian Path is a path that: Think of the vertices as houses in
Continue reading
Euler Paths and Euler Circuits
๐ฟ What Exactly Is an Euler Path? An Euler Path is a walk through a graph where: Think of it
Continue reading
Bipartite Graphs โ When Vertices Form Two Friendly Teams
๐ฑ What Is a Bipartite Graph? (In Very Simple Words) A bipartite graph is a graph whose vertices can be
Continue reading
Regular Graphs โ When Every Node Gets Equal Attention
Imagine you are watching a group of friends sitting in a circle.Each friend is talking to exactly two people โ
Continue reading
Complete Graph โ Data Structures
๐ What Is a Complete Graph? A complete graph is a graph in which: ๐ Every vertex has a direct
Continue reading
Homeomorphic Graphs โ Data Structures
๐ What Are Homeomorphic Graphs? Two graphs are called homeomorphic if: ๐ You can turn one graph into the other๐
Continue reading
Isomorphic Graphs โ Data Structures
๐น What Does โIsomorphicโ Mean? The word isomorphic comes from Greek: So, isomorphic graphs are graphs that have the same
Continue reading
Directed Graph โ Data Structures
๐น What Is a Directed Graph? A directed graph is made up of: A directed edge has a start point
Continue reading