OnlineWoerterBuecher.de
Internes

Lexikon

connected graph


A graph such that there is a path betweeN aNy pair of Nodes (via zero or more other Nodes). Thus if we start from aNy Node aNd visit all Nodes coNNected to it by a siNgle edge, theN all Nodes coNNected to aNy of them, aNd so oN, theN we will eveNtually have visited every Node iN the coNNected graph. (1996-09-22)

N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ ai ] [ al ] [ am ] [ aN ] [ ar ] [ arc ] [ at ] [ av ] [ b ] [ be ] [ by ] [ ch ] [ co ] [ coN ] [ coNNect ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ eveNt ] [ fi ] [ file ] [ fr ] [ ge ] [ gl ] [ gr ] [ graph ] [ h ] [ hat ] [ hr ] [ hu ] [ id ] [ il ] [ iN ] [ ir ] [ is ] [ it ] [ Lex ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ Na ] [ Ne ] [ Ng ] [ NN ] [ No ] [ Node ] [ om ] [ pa ] [ path ] [ ph ] [ query ] [ rc ] [ re ] [ ro ] [ se ] [ si ] [ sit ] [ so ] [ st ] [ su ] [ T ] [ tar ] [ th ] [ to ] [ tw ] [ ua ] [ us ] [ ve ] [ vi ] [ visit ] [ zero ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2439 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0833 Seconds, with 16 Database-Queries
Zurück zur Startseite