Knuth's Simpath algorithm - Revision history

JJMC89 bot III: Moving :Category:Algorithms in graph theory to :Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4

2024-10-12T19:56:55Z

Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4

← Previous revision		Revision as of 19:56, 12 October 2024
Line 15:		Line 15:
	[[Category:Computer arithmetic algorithms]]		[[Category:Computer arithmetic algorithms]]
	[[Category:Donald Knuth]]		[[Category:Donald Knuth]]
	[[Category:~~Algorithms~~ ~~in graph theory~~]]		[[Category:Graph algorithms]]
	[[Category:Mathematical logic]]		[[Category:Mathematical logic]]
	[[Category:Theoretical computer science]]		[[Category:Theoretical computer science]]

JJMC89 bot III: Moving :Category:Graph algorithms to :Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms

2024-10-12T02:24:08Z

Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms

← Previous revision		Revision as of 02:24, 12 October 2024
Line 15:		Line 15:
	[[Category:Computer arithmetic algorithms]]		[[Category:Computer arithmetic algorithms]]
	[[Category:Donald Knuth]]		[[Category:Donald Knuth]]
	[[Category:~~Graph~~ ~~algorithms~~]]		[[Category:Algorithms in graph theory]]
	[[Category:Mathematical logic]]		[[Category:Mathematical logic]]
	[[Category:Theoretical computer science]]		[[Category:Theoretical computer science]]

Jona: /* External links */

2024-03-12T18:24:41Z

External links

← Previous revision		Revision as of 18:24, 12 March 2024
Line 7:		Line 7:
	{{Wikiquote}}		{{Wikiquote}}
	* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.		* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
	* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.		* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath A CWEB implementation by Donald Knuth].

Mike Peel: Removing misplaced Commons category link

2020-07-11T22:29:02Z

Removing misplaced Commons category link

← Previous revision		Revision as of 22:29, 11 July 2020
Line 6:		Line 6:
	==External links==		==External links==
	{{Wikiquote}}		{{Wikiquote}}
	{{Commons category\|Donald Ervin Knuth}}
	* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.		* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
	* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.		* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.

OAbot: Open access bot: doi added to citation with #oabot.

2020-04-17T23:19:51Z

Open access bot: doi added to citation with #oabot.

← Previous revision		Revision as of 23:19, 17 April 2020
Line 1:		Line 1:
	'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume 4A\|date=2011\|publisher=Addison-Wesley Professional: Boston, MA, USA\|page=254,275}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|issue=2\|pages=176–213\|doi=10.3390/a5020176\|last1=Yoshinaka\|first1=Ryo\|last2=Saitoh\|first2=Toshiki\|last3=Kawahara\|first3=Jun\|last4=Tsuruma\|first4=Koji\|last5=Iwashita\|first5=Hiroaki\|last6=Minato\|first6=Shin-Ichi}}</ref>		'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume 4A\|date=2011\|publisher=Addison-Wesley Professional: Boston, MA, USA\|page=254,275}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|issue=2\|pages=176–213\|doi=10.3390/a5020176\|last1=Yoshinaka\|first1=Ryo\|last2=Saitoh\|first2=Toshiki\|last3=Kawahara\|first3=Jun\|last4=Tsuruma\|first4=Koji\|last5=Iwashita\|first5=Hiroaki\|last6=Minato\|first6=Shin-Ichi\|doi-access=free}}</ref>

	==References==		==References==

Citation bot: Add: issue, author pars. 1-6. | You can use this bot yourself. Report bugs here.| Activated by User:Corvusphalanx

2019-08-16T06:56:41Z

Add: issue, author pars. 1-6. | You can use this bot yourself. Report bugs here.| Activated by User:Corvusphalanx

← Previous revision		Revision as of 06:56, 16 August 2019
Line 1:		Line 1:
	'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume 4A\|date=2011\|publisher=Addison-Wesley Professional: Boston, MA, USA\|page=254,275}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|pages=176–213\|doi=10.3390/a5020176}}</ref>		'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume 4A\|date=2011\|publisher=Addison-Wesley Professional: Boston, MA, USA\|page=254,275}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|issue=2\|pages=176–213\|doi=10.3390/a5020176\|last1=Yoshinaka\|first1=Ryo\|last2=Saitoh\|first2=Toshiki\|last3=Kawahara\|first3=Jun\|last4=Tsuruma\|first4=Koji\|last5=Iwashita\|first5=Hiroaki\|last6=Minato\|first6=Shin-Ichi}}</ref>

	==References==		==References==

A3nm: /* External links */ fix link formatting

2017-09-18T15:51:12Z

External links: fix link formatting

← Previous revision		Revision as of 15:51, 18 September 2017
Line 8:		Line 8:
	{{Commons category\|Donald Ervin Knuth}}		{{Commons category\|Donald Ervin Knuth}}
	* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.		* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
	[http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.		* [http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.

2605:A601:15A:F000:226:BBFF:FE02:6605: updated a book reference; added a reference to source code

2017-07-31T04:40:05Z

updated a book reference; added a reference to source code

← Previous revision		Revision as of 04:40, 31 July 2017
Line 1:		Line 1:
	'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume ~~4, Fascicle 1~~\|date=~~2009~~\|publisher=Addison-Wesley Professional: Boston, MA, USA}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|pages=176–213\|doi=10.3390/a5020176}}</ref>		'''Simpath''' is an [[algorithm]] introduced by [[Donald Knuth]] that constructs a [[zero-suppressed decision diagram]] (ZDD) representing all simple paths between two vertices in a given graph.<ref>{{cite book\|last1=Knuth\|first1=Donald\|title=The Art of Computer Programming, Volume 4A\|date=2011\|publisher=Addison-Wesley Professional: Boston, MA, USA\|page=254,275}}</ref><ref>{{cite journal\|title=Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs\|journal=Algorithms\|date=2012\|volume=5\|pages=176–213\|doi=10.3390/a5020176}}</ref>

	==References==		==References==
Line 8:		Line 8:
	{{Commons category\|Donald Ervin Knuth}}		{{Commons category\|Donald Ervin Knuth}}
	* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.		* [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
			[http://www-cs-faculty.stanford.edu/~knuth/programs.html#simpath], A CWEB implementation by Donald Knuth.

Look2See1: /* External links */

2016-06-27T17:09:26Z

External links

@@ Line 9: / Line 9: @@
 * [https://github.com/takemaru/graphillion Graphillion library] which implements the algorithm for manipulating large sets of paths and other structures.
 [[Category:Mathematical logic]]
 [[Category:Theoretical computer science]]

Dekart: removed Category:Algorithms; added Category:Graph algorithms using HotCat

2015-08-24T10:09:51Z

removed Category:Algorithms; added Category:Graph algorithms using HotCat

← Previous revision		Revision as of 10:09, 24 August 2015
Line 11:		Line 11:
	{{algorithm-stub}}		{{algorithm-stub}}

	[[Category:~~Algorithms~~\| ]]		[[Category:Graph algorithms\| ]]
	[[Category:Mathematical logic]]		[[Category:Mathematical logic]]
	[[Category:Theoretical computer science]]		[[Category:Theoretical computer science]]