Weak component
id:
weak-component-306-4567999
title:
Weak component
text:
In graph theory, the weak components of a directed graph partition the vertices of the graph into subsets that are totally ordered by reachability. They form the finest partition of the set of vertices that is totally ordered in this way.
brand slug:
wiki
category slug:
encyclopedia
description:
Partition of vertices of a directed graph
original url:
https://en.wikipedia.org/wiki/Weak_component
date created:
date modified:
2024-03-09T22:32:45Z
main entity:
{"identifier":"Q110612946","url":"https://www.wikidata.org/entity/Q110612946"}
image:
fields total:
13
integrity:
14