Graphs - Revision history

Admin: /* Directed Acyclic Graphs */

2017-09-09T11:11:52Z

Directed Acyclic Graphs

← Older revision		Revision as of 11:11, 9 September 2017
Line 43:		Line 43:
	Directed acyclic graphs: [[Graphs/DAGs]]		Directed acyclic graphs: [[Graphs/DAGs]]

	Topographical sort of directed acyclic graphs: [[Graphs/~~Transitive Closure~~]]		Topographical sort of directed acyclic graphs: [[Graphs/Topological Sort]]

	===Shortest Paths===		===Shortest Paths===

2017-09-09T11:09:43Z

Directed Acyclic Graphs

← Older revision		Revision as of 11:09, 9 September 2017
Line 43:		Line 43:
	Directed acyclic graphs: [[Graphs/DAGs]]		Directed acyclic graphs: [[Graphs/DAGs]]

	Topographical sort of directed acyclic graphs:		Topographical sort of directed acyclic graphs: [[Graphs/Transitive Closure]]

	===Shortest Paths===		===Shortest Paths===

2017-09-09T08:18:50Z

Directed Acyclic Graphs

← Older revision		Revision as of 08:18, 9 September 2017
Line 37:		Line 37:
	===Directed Acyclic Graphs===		===Directed Acyclic Graphs===

	Directed acyclic graphs: [[DAGs]]		Directed acyclic graphs are graphs that are both directed and that do not contain cycle.

			Detecting cycles: [[Graphs/Cycles]]

			Directed acyclic graphs: [[Graphs/DAGs]]

	Topographical sort of directed acyclic graphs:		Topographical sort of directed acyclic graphs:

2017-09-05T09:56:13Z

Transitive Closure

← Older revision		Revision as of 09:56, 5 September 2017
Line 31:		Line 31:
	===Transitive Closure===		===Transitive Closure===

	Transitive closure graphs:		Transitive closure graphs: [[Graphs/Transitive Closure]]

			Floyd Warshall algorithm: [[Graphs/Floyd Warshall]]

	===Directed Acyclic Graphs===		===Directed Acyclic Graphs===

2017-09-05T09:17:33Z

Graph Traversals

← Older revision		Revision as of 09:17, 5 September 2017
Line 20:		Line 20:

	{{Main\|Graphs/Traversal}}		{{Main\|Graphs/Traversal}}

			This is arguably the most important graph algorithm, as many, many graph algorithms are based on the traversal procedure.

	Depth first search and traversals on graphs: [[Graphs/Depth First Traversal]]		Depth first search and traversals on graphs: [[Graphs/Depth First Traversal]]

2017-09-05T09:15:29Z

← Older revision		Revision as of 09:15, 5 September 2017
Line 1:		Line 1:
	Graphs are mathematical objects consisting of ~~nodes~~ and edges. The original inventor of graph theory was Leonhard Euler, who used it to solve the Seven Bridges of Königsberg problem.		Graphs are mathematical objects consisting of vertices and edges.

			The original inventor of graph theory was (arguably) Leonhard Euler, who used it to solve the Seven Bridges of Königsberg problem.

	=Notes=		=Notes=

2017-09-05T08:44:24Z

Directed Acyclic Graphs

← Older revision		Revision as of 08:44, 5 September 2017
Line 31:		Line 31:
	===Directed Acyclic Graphs===		===Directed Acyclic Graphs===

	Topographical sort of directed acyclic graphs:		Directed acyclic graphs: [[DAGs]]

			Topographical sort of directed acyclic graphs:

	===Shortest Paths===		===Shortest Paths===

2017-09-05T08:32:53Z

Graph Traversals

← Older revision		Revision as of 08:32, 5 September 2017
Line 16:		Line 16:

	===Graph Traversals===		===Graph Traversals===

			{{Main\|Graphs/Traversal}}

	Depth first search and traversals on graphs: [[Graphs/Depth First Traversal]]		Depth first search and traversals on graphs: [[Graphs/Depth First Traversal]]

	Breadth first search and traversals on graphs: [[Graphs/Breadth First Traversal]]		Breadth first search and traversals on graphs: [[Graphs/Breadth First Traversal]]

			Euler tours on graphs: [[Graphs/Euler Tour]]

	===Transitive Closure===		===Transitive Closure===

2017-09-05T08:32:17Z

Graph Traversals

← Older revision		Revision as of 08:32, 5 September 2017
Line 17:		Line 17:
	===Graph Traversals===		===Graph Traversals===

	Depth first search on graphs: [[Graphs/Depth First ~~Search~~]]		Depth first search and traversals on graphs: [[Graphs/Depth First Traversal]]

	Breadth first search on graphs: [[Graphs/Breadth First ~~Search~~]]		Breadth first search and traversals on graphs: [[Graphs/Breadth First Traversal]]

	===Transitive Closure===		===Transitive Closure===

2017-09-05T08:30:50Z

Graph Traversals

← Older revision		Revision as of 08:30, 5 September 2017
Line 17:		Line 17:
	===Graph Traversals===		===Graph Traversals===

	Depth first search on graphs:		Depth first search on graphs: [[Graphs/Depth First Search]]

	Breadth first search on graphs:		Breadth first search on graphs: [[Graphs/Breadth First Search]]

	===Transitive Closure===		===Transitive Closure===