#	exclusive	inclusive	rows x	rows	loops	node
1.	0.158	55.012	↑ 11.4	71	1	→ Sort (cost=146.63..148.65 rows=808 width=138) (actual time=55.009..55.012 rows=71 loops=1) Sort Key: n.nspname, p.proname, (pg_get_function_arguments(p.oid)) Sort Method: quicksort Memory: 43kB
2.	1.378	54.854	↑ 11.4	71	1	→ Hash Join (cost=1.14..107.61 rows=808 width=138) (actual time=42.495..54.854 rows=71 loops=1) Hash Cond: (p.pronamespace = n.oid)
3.	53.465	53.465	↓ 3.0	2,402	1	→ Seq Scan on pg_proc p (cost=0.00..89.30 rows=808 width=78) (actual time=0.052..53.465 rows=2,402 loops=1) Filter: pg_function_is_visible(oid)
4.	0.004	0.011	↑ 1.0	4	1	→ Hash (cost=1.09..1.09 rows=4 width=68) (actual time=0.011..0.011 rows=4 loops=1) Buckets: 1,024 Batches: 1 Memory Usage: 1kB
5.	0.007	0.007	↑ 1.0	4	1	→ Seq Scan on pg_namespace n (cost=0.00..1.09 rows=4 width=68) (actual time=0.005..0.007 rows=4 loops=1) Filter: ((nspname <> 'pg_catalog'::name) AND (nspname <> 'information_schema'::name))

For example:
                                                        QUERY PLAN
---------------------------------------------------------------------------------------------------------------------------
 Sort  (cost=146.63..148.65 rows=808 width=138) (actual time=55.009..55.012 rows=71 loops=1)
   Sort Key: n.nspname, p.proname, (pg_get_function_arguments(p.oid))
   Sort Method: quicksort  Memory: 43kB
   ->  Hash Join  (cost=1.14..107.61 rows=808 width=138) (actual time=42.495..54.854 rows=71 loops=1)
         Hash Cond: (p.pronamespace = n.oid)
         ->  Seq Scan on pg_proc p  (cost=0.00..89.30 rows=808 width=78) (actual time=0.052..53.465 rows=2402 loops=1)
               Filter: pg_function_is_visible(oid)
         ->  Hash  (cost=1.09..1.09 rows=4 width=68) (actual time=0.011..0.011 rows=4 loops=1)
               Buckets: 1024  Batches: 1  Memory Usage: 1kB
               ->  Seq Scan on pg_namespace n  (cost=0.00..1.09 rows=4 width=68) (actual time=0.005..0.007 rows=4 loops=1)
                     Filter: ((nspname <> 'pg_catalog'::name) AND (nspname <> 'information_schema'::name))

Per node type stats

node type	count	sum of times	% of query
Hash	1	0.004 ms	0.0 %
Hash Join	1	1.378 ms	2.5 %
Seq Scan	2	53.472 ms	97.2 %
Sort	1	0.158 ms	0.3 %

Per table stats

Table name	Scan count	Total time	% of query
scan type	count	sum of times	% of table
pg_namespace	1	0.007 ms	0.0 %
Seq Scan	1	0.007 ms	100.0 %
pg_proc	1	53.465 ms	97.2 %
Seq Scan	1	53.465 ms	100.0 %

explain.depesz.com

PostgreSQL's explain analyze made readable

Result: axgH

Color mode:

Visible columns:

Per node type stats

Per table stats