a k#d@sxddlmZddlmZmZmZmZmZmZm Z ddl m Z ddl m Z ee e fZe rdddlmZGdddeZdS) ) defaultdict)UnionListOptionalDictTupleSet TYPE_CHECKING)log_automotive)EcuState)_TransitionTuplec@s`eZdZdZddZdddZddZd d Zed d Z ed dZ dddZ e ddZ dS)Grapha Helper object to store a directional Graph of EcuState objects. An edge in this Graph is defined as Tuple of two EcuStates. A node is defined as EcuState. self.edges is a dict of all possible next nodes e.g. {'X': ['A', 'B', 'C', 'E'], ...} self.__transition_functions has all the transition_functions between two nodes, with the two nodes as a tuple as the key e.g. {('X', 'A'): 7, ('X', 'B'): 2, ...} cCstt|_i|_i|_dS)N)rlistedges_Graph__transition_functionsweightsselfr]/var/www/html/gsl.tools/lib/python3.9/site-packages/scapy/contrib/automotive/scanner/graph.py__init__"s zGraph.__init__NcCs0|j|d|dd|j|<||j|<dS)z Inserts new edge in directional graph :param edge: edge from node to node :param transition_function: tuple with enter and cleanup function rN)rappendrr)redgeZtransition_functionrrradd_edge(s zGraph.add_edgecCs|j|dS)z Returns a TransitionTuple for an Edge, if available. :param edge: Tuple of EcuStates :return: According TransitionTuple or None N)rgetrrrrrget_transition_tuple_for_edge3sz#Graph.get_transition_tuple_for_edgecCs.z|j|d7<Wnty(Yn0dS)zs Increases the weight of an Edge :param edge: Edge on which the weight has t obe increased rN)rKeyErrorrrrr downrate_edge<s zGraph.downrate_edgecCs|jS)zH Get the dict of all TransistionTuples :return: )rrrrrtransition_functionsGszGraph.transition_functionscCstdd|jDS)zG Get a set of all nodes in this Graph :return: cSs$g|]\}}||gD]}|qqSrr).0kpnrrr WzGraph.nodes..)setritemsrrrrnodesPsz Graph.nodesSystemStateGraph.gvTc Cszddlm}Wnty.tdYdS0|ddddd d d id }|jD]}|t|qP|j D]`\}}z|durd n |dd}Wnt t fyd }Yn0|j t|dt|d|dqn|j ||ddS)z Renders this Graph as PDF, if `graphviz` is installed. :param filename: A filename for the rendered PDF. :param view: If True, rendered file will be opened. r)DigraphzPlease install graphviz.NZSystemStateGraphZ lightgreyZfilledbox)Z fillcolorstyleshapeZ concentratetrue)nameZ node_attrZ graph_attrrdesc)label)view)graphvizr+ ImportErrorr infor)nodestrrr(AttributeErrorrrrender) rfilenamer4r+Zpsr$efr2rrrr;Ys*    "z Graph.renderc s|di|}t||kr||j|}|d}|D]L}|j||f|}|vrj||f|<q>|d}||kr>||f|<q>fddDsgStfddd}q|d} |g} | d ur| | | d} q| | S) aW Compute shortest paths from initial to end in graph Partly from https://benalexkeen.com/implementing-djikstras-shortest-path-algorithm-with-python/ # noqa: E501 :param graph: Graph where path is computed :param initial: Start node :param end: End node :return: A path as list of nodes )Nrrcsi|]}|vr||qSrr)r!r8)shortest_pathsvisitedrr sz"Graph.dijkstra..cs |dS)Nrr)r")next_destinationsrrr&z Graph.dijkstra..)keyrN)r'addrrminrreverse) graphinitialendZ current_node destinationsZweight_to_current_nodeZ next_nodeweightZcurrent_shortest_weightZ last_nodepathr)rBr?r@rdijkstraxs>          zGraph.dijkstra)N)r*T)__name__ __module__ __qualname____doc__rrrrpropertyr r)r; staticmethodrNrrrrr s       r N) collectionsrZ scapy.compatrrrrrrr Zscapy.contrib.automotiver Zscapy.contrib.automotive.ecur Z_EdgeZ*scapy.contrib.automotive.scanner.test_caser objectr rrrr s $