Sci-Tech Dictionary:
(¦ströŋ·lē kə¦nek·təd ′dī′graf)
strongly connected digraph
(mathematics) A directed graph in which there is a directed path from every vertex to every other vertex.
Join the WikiAnswers Q&A community. Post a question or answer questions about "strongly connected digraph" at WikiAnswers.
Copyrights:
 |
 | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |
Search for answers directly from your browser with the FREE Answers.com Toolbar!
Click here to download now. 
Get Answers your way! Check out all our free tools and products.
ADVERTISEMENT
Tackle These
- Halfway to the center of the Earth would gravity pull on you more strongly or ...
- Do you need to vent a new toilet in a basement if it is connected to a 3-inch ...
- Connected two printers to one computer and when trying to print an error ...
- Program in c language using Depth first search DFS to convert each edge in ... [unanswered]
- Let GVE be an undirected graph Use depth-first search to develop aprogram using ... [unanswered]
- What is the difference between a digraph and a blend? [unanswered]
Keep Reading
ADVERTISEMENT
