Go to Analyze > Select Cul-de-Sacs 
Identifies cul-de-sac or blind alleys, which are defined like this:
Position yourself in a node and drive in one direction using link A. If you can't get back to the same node without using the same link A again, it is a cul-de-sac.
If you however can come back without making a U-turn, it is a bridge in graph theory terms: If the link was missing, the network would be split into 2 components or subnets.
A map is shown below:
This browser is displayed after the function has completed to help in detecting the Cul-De-Sacs.
You can select a record from this browser and then use right click in the map window and then select "Find Selection" to move to that point on the map.
Please note that settings such as one-ways, avoiding no through roads, limits and avoids may affect the results. Therefore we recommend that this test is run without any of those setting being active.