294
295 implicit none
296
297 class(dag),intent(in) :: me
298 character(len=:),allocatable :: str
299 character(len=*),intent(in),optional :: rankdir
300 integer,intent(in),optional :: dpi
301 character(len=*),intent(in),optional :: edge
302
303 integer :: i,j
304 integer :: n_edges
305 character(len=:),allocatable :: attributes,label
306 logical :: has_label, has_attributes
307
308 character(len=*),parameter :: tab = ' '
309 character(len=*),parameter :: newline = new_line(' ')
310
311 if (me%n == 0) return
312
313 str = 'digraph G {'//newline//newline
314 if (present(rankdir)) &
315 str = str//tab//'rankdir='//rankdir//newline//newline
316 if (present(dpi)) &
317 str = str//tab//'graph [ dpi = '//integer_to_string(dpi)//' ]'//newline//newline
318 if (present(edge)) &
319 str = str//tab//'edge [ dir = "'//trim(adjustl(edge))//'" ]'//newline//newline
320
321
322 do i=1,me%n
323 has_label = allocated(me%vertices(i)%label)
324 has_attributes = allocated(me%vertices(i)%attributes)
325 if (has_label) label = 'label="'//trim(adjustl(me%vertices(i)%label))//'"'
326 if (has_label .and. has_attributes) then
327 attributes = '['//trim(adjustl(me%vertices(i)%attributes))//','//label//']'
328 elseif (has_label .and. .not. has_attributes) then
329 attributes = '['//label//']'
330 elseif (.not. has_label .and. has_attributes) then
331 attributes = '['//trim(adjustl(me%vertices(i)%attributes))//']'
332 else
333 attributes = ''
334 end if
335 str = str//tab//integer_to_string(i)//' '//attributes//newline
336 if (i==me%n) str = str//newline
337 end do
338
339
340 do i=1,me%n
341 if (allocated(me%vertices(i)%edges)) then
342 n_edges = size(me%vertices(i)%edges)
343 str = str//tab//integer_to_string(i)//' -> '
344 do j=1,n_edges
345
346 str = str//integer_to_string(me%vertices(i)%edges(j))
347 if (n_edges>1 .and. j<n_edges) str = str//','
348 end do
349 str = str//';'//newline
350 end if
351 end do
352
353 str = str//newline//'}'
354