Decrease-and-conquer
Breadth-first search
Breadth-first search is a graph traversal algorithm that starts
traversing the graph from the root node and explores all
the neighboring nodes.
The depth-first search (DFS)
The depth-first search (DFS) algorithm
starts with the initial node of graph G and goes deeper until we find the goal
node or the node with no children.
Topological sorting
Topological sort is a
linear ordering of vertices in a directed acyclic graph (DAG).
Given a DAG G = (V, E), a topological
sort algorithm returns a sequence of vertices in which the vertices never come
before their predecessors on any paths.
In other words, if (u, v) ∈ E, v never appears before u in the sequence.
Connected component
A connected component or simply component of an
undirected graph is a subgraph in which each pair of nodes is
connected with each other via a path.
Spanning Tree
Bridge Edge
A bridge is defined as an edge which, when removed,
makes the graph disconnected (or more precisely, increases the number of
connected components in the graph)
Milan Tomic
Hi. I’m Designer of Blog Magic. I’m CEO/Founder of ThemeXpose. I’m Creative Art Director, Web Designer, UI/UX Designer, Interaction Designer, Industrial Designer, Web Developer, Business Enthusiast, StartUp Enthusiast, Speaker, Writer and Photographer. Inspired to make things looks better.
0 comments:
Post a Comment