The On-Line Encyclopedia of Bongard Problems

Search: concept:connected_component

Displaying 1-2 of 2 results found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

There is a path between any two nodes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Graph_theory` `https://en.wikipedia.org/wiki/Connectivity_(graph_theory)`
	CROSSREFS	`Adjacent-numbered pages: BP1095 BP1096 BP1097 BP1098 BP1099 * BP1101 BP1102 BP1103 BP1104 BP1105`
	KEYWORD	`precise, allsorted, world, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `connected_component (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left (connected_graph) \| zoom in right (disconnected_graph)`
	AUTHOR	`Leo Crabbe`

Connected fractal vs. disconnected fractal.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP1232 BP1233 BP1234 BP1235 BP1236 * BP1238 BP1239 BP1240 BP1241 BP1242`
	KEYWORD	`notso, perfect, infinitedetail`
	CONCEPT	`connected_component (info \| search),` `fractal (info \| search)`
	WORLD	`fractal_self_tile [smaller \| same \| bigger] zoom in left (connected_fractal_self_tile)`
	AUTHOR	`Jago Collins`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)