我面临一个问题,需要我获取环内的节点。我写了一个recursie方法,但它没有做我想做的事,所以我需要一些帮助。从图中只获取环节点
下面的picture解释了我在寻找什么,因为我很难解释它。
给出根节点0,我想从它基本上是0的那些节点,1,2,7,8得到环,9
记住,每个节点包含连接到的节点的列表它,所以节点0将节点1和节点9连接到它。所以一切都在那里,但我不能得到正确的逻辑来得到那个戒指。这里是我写的方法,但不幸的是它不适用于所有图表。
private bool SetMainRingList(StructureFeature strct, StructureFeature root, List<StructureFeature> mainRing) {
if ((strct.Equals(root) && mainRing.Contains(strct))) {
return false;
}
var children = strct.GetConnectedStructures();
if ((children.Contains(root) && mainRing.Contains(strct))) {
return false;
}
mainRing.Add(strct);
foreach (var structureFeature in children) {
if (mainRing.Contains(structureFeature)) {
var strcture = mainRing.Find(x => x.Oid == structureFeature.Oid);
if (strcture.ParentFeature == null)
continue;
if (strcture.ParentFeature.Equals(root)) {
bool skip = false;
var crntChildren = strcture.GetConnectedStructures();
foreach (var childContainerse in crntChildren) {
if (!mainRing.Contains(childContainerse)) {
skip = true;
break;
}
}
if (!skip)
return false;
}
continue;
}
structureFeature.ParentFeature = strct;
var leaf = SetMainRingList(structureFeature, root, mainRing);
var exchangeSite = structureFeature as ExchangeStructure;
if (leaf && ReferenceEquals(exchangeSite, null)) {
mainRing.Remove(structureFeature);
} else {
return false;
}
}
return true;
}
交叉发布到http://gis.stackexchange.com/questions/181894/diagram-ring-elements-locator-tough-problem – PolyGeo