graph algorithms figure graph for euler circuit problem figure graph remaining after figure graph after the path current patha circuit of is obtained as all the edges are traversedthe algorithm terminates with an euler circuit to make this algorithm efficientwe must use appropriate data structures we will sketch some of the ideasleaving the implementation as an exercise to make splicing simplethe path should be maintained as linked list to avoid repetitious scanning of adjacency listswe must maintainfor each adjacency lista pointer to the last edge scanned when path is spliced inthe search for new vertex from which to perform the next depth-first search must begin at the start of the splice point this guarantees that