1. A method for determining deadlock-critical relations between networked components of a vehicle system, in which a graph, which at least partially represents the inhibit relations defined in the vehicle system and has nodes and edges, is used, comprising: classifying at least a portion of the edges on the basis of properties of the edges and the nodes that are connected by the edges; prioritizing the edges on the basis of the classification; and determining a shortest, deadlock-critical cycles for all nodes and at least a few edges on the basis of the prioritization.